SIMPLE PREFIX SUM C++ SOLUTION
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:o(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:o(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int largestAltitude(vector<int>& gain) {\n        int n = gain.size();\n        vector<int>pref(n+1,0);\n        pref[0] = gain[0];\n        for(int i = 1; i < n; i++){\n            pref[i] = pref[i-1] + gain[i];\n        }\n        return *max_element(pref.begin(), pref.end());\n    }\n};\n```
['C++']