Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit c75df9f

Browse files
committed
feat: update solutions to lc problems
1 parent 36fb36c commit c75df9f

File tree

49 files changed

+441
-98
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

49 files changed

+441
-98
lines changed

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

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -97,7 +97,6 @@ class Solution {
9797
}
9898
int i = 0;
9999
for (; i < stk.length() && stk.charAt(i) == '0'; ++i) {
100-
101100
}
102101
String ans = stk.substring(i);
103102
return "".equals(ans) ? "0" : ans;

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

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -79,7 +79,6 @@ class Solution {
7979
}
8080
int i = 0;
8181
for (; i < stk.length() && stk.charAt(i) == '0'; ++i) {
82-
8382
}
8483
String ans = stk.substring(i);
8584
return "".equals(ans) ? "0" : ans;

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

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,6 @@ class Solution {
1414
}
1515
int i = 0;
1616
for (; i < stk.size() && stk[i] == '0'; ++i) {
17-
1817
}
1918
string ans = stk.substr(i);
2019
return ans == "" ? "0" : ans;

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

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,6 @@ public String removeKdigits(String num, int k) {
1313
}
1414
int i = 0;
1515
for (; i < stk.length() && stk.charAt(i) == '0'; ++i) {
16-
1716
}
1817
String ans = stk.substring(i);
1918
return "".equals(ans) ? "0" : ans;

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

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -114,7 +114,8 @@ class Solution {
114114
if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
115115
f[i][j] = f[i - 1][j - 1];
116116
} else {
117-
f[i][j] = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
117+
f[i][j]
118+
= Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
118119
}
119120
}
120121
}

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

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -83,7 +83,8 @@ class Solution {
8383
if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
8484
f[i][j] = f[i - 1][j - 1];
8585
} else {
86-
f[i][j] = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
86+
f[i][j]
87+
= Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
8788
}
8889
}
8990
}

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

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,8 @@ public int minimumDeleteSum(String s1, String s2) {
1313
if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
1414
f[i][j] = f[i - 1][j - 1];
1515
} else {
16-
f[i][j] = Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
16+
f[i][j]
17+
= Math.min(f[i - 1][j] + s1.charAt(i - 1), f[i][j - 1] + s2.charAt(j - 1));
1718
}
1819
}
1920
}

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

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -167,7 +167,6 @@ class Node {
167167
public Node prev, next;
168168

169169
public Node() {
170-
171170
}
172171

173172
public Node(int val) {
@@ -213,7 +212,6 @@ class MaxStack {
213212
private TreeMap<Integer, List<Node>> tm = new TreeMap<>();
214213

215214
public MaxStack() {
216-
217215
}
218216

219217
public void push(int x) {

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

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -139,7 +139,6 @@ class Node {
139139
public Node prev, next;
140140

141141
public Node() {
142-
143142
}
144143

145144
public Node(int val) {
@@ -185,7 +184,6 @@ class MaxStack {
185184
private TreeMap<Integer, List<Node>> tm = new TreeMap<>();
186185

187186
public MaxStack() {
188-
189187
}
190188

191189
public void push(int x) {

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

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,6 @@ class Node {
33
public Node prev, next;
44

55
public Node() {
6-
76
}
87

98
public Node(int val) {
@@ -49,7 +48,6 @@ class MaxStack {
4948
private TreeMap<Integer, List<Node>> tm = new TreeMap<>();
5049

5150
public MaxStack() {
52-
5351
}
5452

5553
public void push(int x) {

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /