add 300

Author: shishishu

README.md

@@ -49,4 +49,5 @@ Idx | Date | Question | Python| Java | Domain | Tag | Difficulty | Remark
 043|20200627|[109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)|[109p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/109_Convert_Sorted_List_to_Binary_Search_Tree.ipynb)|[109j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/109/Solution.java)|BST|Recursive|Medium
 044|20200705|[28. Implement strStr()](https://leetcode.com/problems/implement-strstr/)|[028p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/028_Implement_strStr().ipynb)|[028j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/028/Solution.java)|String|KMP|Easy
 045|20200816|[56. Merge Intervals](https://leetcode.com/problems/merge-intervals/)|[056p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/056_Merge_Intervals.ipynb)|[056j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/056/Solution.java)|Sort||Medium
-046|20200816|[57. Insert Interval](https://leetcode.com/problems/insert-interval/)|[057p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/057_Insert_Interval.ipynb)|[057j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/057/Solution.java)|Sort||Hard
+046|20200816|[57. Insert Interval](https://leetcode.com/problems/insert-interval/)|[057p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/057_Insert_Interval.ipynb)|[057j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/057/Solution.java)|Sort||Hard
+047|20210822|[300. Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)|[300p](https://github.com/shishishu/leetcode-python-java/blob/master/ipynb_files/300_Longest_Increasing_Subsequence.ipynb)|[300j](https://github.com/shishishu/leetcode-python-java/blob/master/java_codes/300/Solution.java)|List|DP|Medium

images/300_Q.PNG

@@ -0,0 +1,20 @@
+class Solution {
+    public int lengthOfLIS(int[] nums) {
+        if (nums == null){
+            return 0;
+        }
+        int len_nums = nums.length;
+        int[] mem = new int[len_nums];
+        int result = 1;
+        for (int i = 0; i < len_nums; i++){
+            mem[i] = 1;
+            for (int j = 0; j < i; j++){
+                if (nums[j] < nums[i]){
+                    mem[i] = Math.max(mem[j] + 1, mem[i]);
+                }
+            }
+            result = Math.max(result, mem[i]);
+        }
+        return result;
+    }
+}

images/300_S1.PNG

@@ -50,6 +50,7 @@
       <sourceFolder url="file://$MODULE_DIR$/028" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/056" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/057" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/300" isTestSource="false" />
     </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />