70

Author: Ashish-kumar7

53.cpp

@@ -0,0 +1,28 @@
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        
+        int current=0;
+        int result=INT_MIN;
+        int n=nums.size();
+        for(int i=0;i<n;i++)
+        {
+            if(current>0)
+            {
+                current+=nums[i];
+            }
+            else 
+            {
+                current=nums[i];
+            }
+            if(result<=current)
+            {
+                result=current;
+            }            
+        }
+        
+        return result;
+        
+        
+    }
+};

70.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int climbStairs(int n) {
+
+        int A[n+1];
+        A[0]=1;
+        A[1]=1;
+        for(int i=2;i<=n;i++)
+        {
+            A[i]=A[i-1]+A[i-2];
+        }
+        
+        int p=A[n];
+        return p;
+    }
+};