add 300, 674, 680.

Author: moranzcw

Algorithms/300.Longest-Increasing-Subsequence/solution.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int lengthOfLIS(vector<int>& nums) {        
+        int maxlen = 0;
+        
+        vector<int> dp(nums.size());
+        for(int i=0;i<nums.size();i++){
+            int max_dp = 0;
+            for(int j=0;j<i;j++){
+                if(nums[i] > nums[j])
+                    max_dp = max(dp[j], max_dp);
+            }
+            dp[i] = max_dp + 1;
+            maxlen = max(dp[i], maxlen);
+        }
+        return maxlen;
+    }
+};

Algorithms/674.Longest-Continuous-Increasing-Subsequence/solution.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int findLengthOfLCIS(vector<int>& nums) {
+        if(nums.size() == 0)
+            return 0;
+        
+        int max = 1;
+        int temp = 1;
+        int last = nums[0];
+        for(int i=1;i<nums.size();i++){
+            if(nums[i] > last){
+                temp += 1;
+                if(temp > max)
+                    max = temp;
+            }
+            else{
+                temp = 1;
+            }
+            last = nums[i];
+        }
+        return max;
+    }
+};

Algorithms/680.Valid-Palindrome-II/solution.cpp

@@ -0,0 +1,37 @@
+class Solution {
+public:
+    bool validPalindrome(string s) {
+        bool skipFlag = true;
+        bool result = true;
+        for(int cur1=0, cur2=s.size()-1; cur1 < cur2; cur1++,cur2--){
+            if(s[cur1] != s[cur2]){
+                if(skipFlag && s[cur1+1] == s[cur2]){
+                    cur1 ++;
+                    skipFlag = false;
+                }
+                else{
+                    result = false;
+                    break;
+                }
+            }
+        }
+        if(result)
+            return result;
+        
+        skipFlag = true;
+        result = true;
+        for(int cur1=0, cur2=s.size()-1; cur1 < cur2; cur1++,cur2--){
+            if(s[cur1] != s[cur2]){
+                if(skipFlag && s[cur1] == s[cur2-1]){
+                    cur2 --;
+                    skipFlag = false;
+                }
+                else{
+                    result = false;
+                    break;
+                }
+            }
+        }
+        return result;
+    }
+};

README.md

@@ -437,6 +437,8 @@
 
 [299.Bulls-and-Cows](Algorithms/299.Bulls-and-Cows/solution.cpp)
 
+[300.Longest-Increasing-Subsequence](Algorithms/300.Longest-Increasing-Subsequence/solution.cpp)
+
 [303.Range-Sum-Query---Immutable](Algorithms/303.Range-Sum-Query---Immutable/solution.cpp)
 
 [309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown](Algorithms/309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/solution.cpp)