Easy C++ Solution | Beats 100%
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\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        for(int i=1; i<n; i++){\n            gain[i]= gain[i-1] + gain[i];\n        }\n        int ans=0;\n        for(int i=0; i<n; i++){\n            if(ans<gain[i]){\n                ans= gain[i];\n            }\n        }\n        return ans;\n    }\n};\n```
['Array', 'Prefix Sum', 'C++']