Create Solution.cpp

base solution

Author: zouwx2cs

solution/0300.Longest Increasing Subsequence/Solution.cpp

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