feat: update solutions to leetcode problem: No.0300

yanglbme · yanglbme · commit 2c23407fd063 · 2021-01-06T21:07:05.000+08:00
diff --git a/solution/0300-0399/0300.Longest Increasing Subsequence/README.md b/solution/0300-0399/0300.Longest Increasing Subsequence/README.md
@@ -63,15 +63,14 @@ class Solution:
 ```java
 class Solution {
     public int lengthOfLIS(int[] nums) {
-        int n;
-        if ((n = nums.length) < 2) return n;
+        int n = nums.length;
         int[] dp = new int[n];
         Arrays.fill(dp, 1);
         int res = 1;
         for (int i = 1; i < n; ++i) {
             for (int j = 0; j < i; ++j) {
                 if (nums[j] < nums[i]) {
-                    dp[i] = Math.max(dp[i], dp[j] + 1);
+                    dp[i] = Math.max(dp[i], dp[j] + 1);   
                 }
             }
             res = Math.max(res, dp[i]);
diff --git a/solution/0300-0399/0300.Longest Increasing Subsequence/README_EN.md b/solution/0300-0399/0300.Longest Increasing Subsequence/README_EN.md
@@ -52,15 +52,14 @@ class Solution:
 ```java
 class Solution {
     public int lengthOfLIS(int[] nums) {
-        int n;
-        if ((n = nums.length) < 2) return n;
+        int n = nums.length;
         int[] dp = new int[n];
         Arrays.fill(dp, 1);
         int res = 1;
         for (int i = 1; i < n; ++i) {
             for (int j = 0; j < i; ++j) {
                 if (nums[j] < nums[i]) {
-                    dp[i] = Math.max(dp[i], dp[j] + 1);
+                    dp[i] = Math.max(dp[i], dp[j] + 1);   
                 }
             }
             res = Math.max(res, dp[i]);
diff --git a/solution/0300-0399/0300.Longest Increasing Subsequence/Solution.java b/solution/0300-0399/0300.Longest Increasing Subsequence/Solution.java
@@ -1,14 +1,13 @@
 class Solution {
     public int lengthOfLIS(int[] nums) {
-        int n;
-        if ((n = nums.length) < 2) return n;
+        int n = nums.length;
         int[] dp = new int[n];
         Arrays.fill(dp, 1);
         int res = 1;
         for (int i = 1; i < n; ++i) {
             for (int j = 0; j < i; ++j) {
                 if (nums[j] < nums[i]) {
-                    dp[i] = Math.max(dp[i], dp[j] + 1);
+                    dp[i] = Math.max(dp[i], dp[j] + 1);   
                 }
             }
             res = Math.max(res, dp[i]);
