feat: update solutions to lc problems

Author: yanglbme

solution/0400-0499/0402.Remove K Digits/README.md

@@ -97,7 +97,6 @@ class Solution {
         }
         int i = 0;
         for (; i < stk.length() && stk.charAt(i) == '0'; ++i) {
-
         }
         String ans = stk.substring(i);
         return "".equals(ans) ? "0" : ans;

solution/0400-0499/0402.Remove K Digits/README_EN.md

@@ -79,7 +79,6 @@ class Solution {
         }
         int i = 0;
         for (; i < stk.length() && stk.charAt(i) == '0'; ++i) {
-
         }
         String ans = stk.substring(i);
         return "".equals(ans) ? "0" : ans;

solution/0400-0499/0402.Remove K Digits/Solution.cpp

@@ -14,7 +14,6 @@ class Solution {
         }
         int i = 0;
         for (; i < stk.size() && stk[i] == '0'; ++i) {
-
         }
         string ans = stk.substr(i);
         return ans == "" ? "0" : ans;

solution/0400-0499/0402.Remove K Digits/Solution.java

@@ -13,7 +13,6 @@ public String removeKdigits(String num, int k) {
         }
         int i = 0;
         for (; i < stk.length() && stk.charAt(i) == '0'; ++i) {
-
         }
         String ans = stk.substring(i);
         return "".equals(ans) ? "0" : ans;

solution/0700-0799/0712.Minimum ASCII Delete Sum for Two Strings/README.md

@@ -114,7 +114,8 @@ class Solution {
                 if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                     f[i][j] = f[i - 1][j - 1];
                 } else {
-                    f[i][j] = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
+                    f[i][j]
+                        = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
                 }
             }
         }

solution/0700-0799/0712.Minimum ASCII Delete Sum for Two Strings/README_EN.md

@@ -83,7 +83,8 @@ class Solution {
                 if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                     f[i][j] = f[i - 1][j - 1];
                 } else {
-                    f[i][j] = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
+                    f[i][j]
+                        = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
                 }
             }
         }

solution/0700-0799/0712.Minimum ASCII Delete Sum for Two Strings/Solution.java

@@ -13,7 +13,8 @@ public int minimumDeleteSum(String s1, String s2) {
                 if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                     f[i][j] = f[i - 1][j - 1];
                 } else {
-                    f[i][j] = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
+                    f[i][j]
+                        = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
                 }
             }
         }

solution/0700-0799/0716.Max Stack/README.md

@@ -167,7 +167,6 @@ class Node {
     public Node prev, next;
 
     public Node() {
-
     }
 
     public Node(int val) {
@@ -213,7 +212,6 @@ class MaxStack {
     private TreeMap<Integer, List<Node>> tm = new TreeMap<>();
 
     public MaxStack() {
-
     }
 
     public void push(int x) {

solution/0700-0799/0716.Max Stack/README_EN.md

@@ -139,7 +139,6 @@ class Node {
     public Node prev, next;
 
     public Node() {
-
     }
 
     public Node(int val) {
@@ -185,7 +184,6 @@ class MaxStack {
     private TreeMap<Integer, List<Node>> tm = new TreeMap<>();
 
     public MaxStack() {
-
     }
 
     public void push(int x) {

solution/0700-0799/0716.Max Stack/Solution.java

@@ -3,7 +3,6 @@ class Node {
     public Node prev, next;
 
     public Node() {
-
     }
 
     public Node(int val) {
@@ -49,7 +48,6 @@ class MaxStack {
     private TreeMap<Integer, List<Node>> tm = new TreeMap<>();
 
     public MaxStack() {
-
     }
 
     public void push(int x) {