style: prettify code

Author: yanglbme

solution/0300-0399/0300.Longest Increasing Subsequence/README.md

@@ -70,7 +70,7 @@ class Solution {
         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]);

solution/0300-0399/0300.Longest Increasing Subsequence/README_EN.md

@@ -59,7 +59,7 @@ class Solution {
         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]);