Skip to content

Commit 42bda89

Browse files
authored
chore: update lc problems (doocs#742)
1 parent 743214a commit 42bda89

File tree

2,415 files changed

+43964
-49607
lines changed

Some content is hidden

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

2,415 files changed

+43964
-49607
lines changed

README.md

Lines changed: 167 additions & 167 deletions
Large diffs are not rendered by default.

README_EN.md

Lines changed: 159 additions & 159 deletions
Large diffs are not rendered by default.

lcci/01.02.Check Permutation/README_EN.md

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -216,7 +216,6 @@ impl Solution {
216216
}
217217
```
218218

219-
220219
### **...**
221220

222221
```

lcci/01.09.String Rotation/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -98,7 +98,7 @@ function isFlipedString(s1: string, s2: string): boolean {
9898
```rust
9999
impl Solution {
100100
pub fn is_fliped_string(s1: String, s2: String) -> bool {
101-
s1.len() == s2.len() && (s2.clone() + &s2).contains(&s1)
101+
s1.len() == s2.len() && (s2.clone() + &s2).contains(&s1)
102102
}
103103
}
104104
```

lcci/01.09.String Rotation/README_EN.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -77,7 +77,7 @@ function isFlipedString(s1: string, s2: string): boolean {
7777
```rust
7878
impl Solution {
7979
pub fn is_fliped_string(s1: String, s2: String) -> bool {
80-
s1.len() == s2.len() && (s2.clone() + &s2).contains(&s1)
80+
s1.len() == s2.len() && (s2.clone() + &s2).contains(&s1)
8181
}
8282
}
8383
```

lcci/02.01.Remove Duplicate Node/README.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -235,20 +235,20 @@ function removeDuplicateNodes(head: ListNode | null): ListNode | null {
235235
*/
236236

237237
function removeDuplicateNodes(head: ListNode | null): ListNode | null {
238-
let n1 = head
238+
let n1 = head;
239239
while (n1 != null) {
240-
let n2 = n1
240+
let n2 = n1;
241241
while (n2.next != null) {
242242
if (n1.val === n2.next.val) {
243243
n2.next = n2.next.next;
244244
} else {
245245
n2 = n2.next;
246246
}
247247
}
248-
n1 = n1.next
248+
n1 = n1.next;
249249
}
250-
return head
251-
};
250+
return head;
251+
}
252252
```
253253

254254
### **Rust**

lcci/02.01.Remove Duplicate Node/README_EN.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -235,20 +235,20 @@ Violence (not recommended)
235235
*/
236236

237237
function removeDuplicateNodes(head: ListNode | null): ListNode | null {
238-
let n1 = head
238+
let n1 = head;
239239
while (n1 != null) {
240-
let n2 = n1
240+
let n2 = n1;
241241
while (n2.next != null) {
242242
if (n1.val === n2.next.val) {
243243
n2.next = n2.next.next;
244244
} else {
245245
n2 = n2.next;
246246
}
247247
}
248-
n1 = n1.next
248+
n1 = n1.next;
249249
}
250-
return head
251-
};
250+
return head;
251+
}
252252
```
253253

254254
### **Rust**

lcci/02.05.Sum Lists/README.md

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -234,7 +234,6 @@ function addTwoNumbers(
234234
}
235235
```
236236

237-
238237
### **Rust**
239238

240239
```rust

lcci/02.05.Sum Lists/README_EN.md

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -229,7 +229,6 @@ function addTwoNumbers(
229229
}
230230
```
231231

232-
233232
### **Rust**
234233

235234
```rust

lcci/04.02.Minimum Height Tree/README_EN.md

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -228,7 +228,6 @@ impl Solution {
228228
}
229229
```
230230

231-
232231
### **...**
233232

234233
```

0 commit comments

Comments
 (0)