Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- /* method 1
- int maxSubArray(vector<int>& nums) {
- int n=nums.size();
- if(n==0)
- return INT_MIN;
- vector<int>v;
- int res=nums[0];
- v.push_back(nums[0]);
- for(int i=1;i<n;i++){
- int x=max(nums[i],nums[i]+v[i-1]);
- v.push_back(x);
- if(x>res)
- res=x;
- }
- return res;
- }
- */
- /* second method (optimal)
- int maxSubArray(vector<int>& nums){
- int n=nums.size();
- int res=INT_MIN;
- if(n==0)
- return res;
- int temp_max=0;
- for(int i=0;i<n;i++){
- temp_max+=nums[i];
- if(temp_max>res)
- res=temp_max;
- if(temp_max<0)
- temp_max=0;
- }
- return res;
- }
- */
- // method 3
- int maxSubArray(vector<int>& nums){
- int n=nums.size();
- int res=INT_MIN;
- if(n==0)
- return res;
- int temp_sum=0;
- for(int i=0;i<n;i++){
- temp_sum=0;
- for(int j=i;j<n;j++){
- temp_sum+=nums[j];
- if(temp_sum>res)
- res=temp_sum;
- }
- }
- return res;
- }
- };
Add Comment
Please, Sign In to add comment