Movatterモバイル変換

[0]ホーム
URL:

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

Commita127a62

Browse files
committed
Removed fence mark in explanations.
1 parent08fb407 commita127a62

21 files changed

+0
-58
lines changed

‎en/1-1000/1-two-sum.md‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -20,9 +20,7 @@ You can return the answer in any order.
2020

2121
**Explanation**:
2222

23-
```
2423
Because nums[0] + nums[1] == 9, we return[0, 1].
25-
```
2624

2725
###[Example 2]
2826

‎en/1-1000/15-3sum.md‎

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -18,13 +18,11 @@ Notice that the solution set must not contain duplicate triplets.
1818

1919
**Explanation**:
2020

21-
```
2221
nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.
2322
nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.
2423
nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.
2524
The distinct triplets are[-1,0,1] and[-1,-1,2].
2625
Notice that the order of the output and the order of the triplets does not matter.
27-
```
2826

2927
###[Example 2]
3028

@@ -34,9 +32,7 @@ Notice that the order of the output and the order of the triplets does not matte
3432

3533
**Explanation**:
3634

37-
```
3835
The only possible triplet does not sum up to 0.
39-
```
4036

4137
###[Example 3]
4238

‎en/1-1000/202-happy-number.md‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -24,12 +24,10 @@ Return `true` if `n` is *a happy number*, and `false` if not.
2424

2525
**Explanation**:
2626

27-
```
2827
1^2 + 9^2 = 82
2928
8^2 + 2^2 = 68
3029
6^2 + 8^2 = 100
3130
1^2 + 0^2 + 0^2 = 1
32-
```
3331

3432
###[Example 2]
3533

‎en/1-1000/209-minimum-size-subarray-sum.md‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -18,9 +18,7 @@ Given an array of positive integers `nums` and a positive integer `target`, retu
1818

1919
**Explanation**:
2020

21-
```
2221
The subarray[4,3] has the minimal length under the problem constraint.
23-
```
2422

2523
###[Example 2]
2624

‎en/1-1000/27-remove-element.md‎

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -21,10 +21,8 @@ Consider the number of elements in `nums` which are not equal to `val` be `k`, t
2121

2222
**Explanation**:
2323

24-
```
2524
Your function should return k = 2, with the first two elements of nums being 2.
2625
It does not matter what you leave beyond the returned k (hence they are underscores).
27-
```
2826

2927
###[Example 2]
3028

@@ -34,11 +32,9 @@ It does not matter what you leave beyond the returned k (hence they are undersco
3432

3533
**Explanation**:
3634

37-
```
3835
Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4.
3936
Note that the five elements can be returned in any order.
4037
It does not matter what you leave beyond the returned k (hence they are underscores).
41-
```
4238

4339
###[Constraints]
4440

‎en/1-1000/28-find-the-index-of-the-first-occurrence-in-a-string.md‎

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -16,10 +16,8 @@ Given two strings `needle` and `haystack`, return the **index** of the first occ
1616

1717
**Explanation**:
1818

19-
```
2019
"sad" occurs at index 0 and 6.
2120
The first occurrence is at index 0, so we return 0.
22-
```
2321

2422
###[Example 2]
2523

@@ -29,9 +27,7 @@ The first occurrence is at index 0, so we return 0.
2927

3028
**Explanation**:
3129

32-
```
3330
"leeto" did not occur in "leetcode", so we return -1.
34-
```
3531

3632
###[Constraints]
3733

‎en/1-1000/303-range-sum-query-immutable.md‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -23,12 +23,10 @@ Implement the `NumArray` class:
2323

2424
**Explanation**:
2525

26-
```
2726
NumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);
2827
numArray.sumRange(0, 2); // return (-2) + 0 + 3 = 1
2928
numArray.sumRange(2, 5); // return 3 + (-5) + 2 + (-1) = -1
3029
numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3
31-
```
3230

3331
###[Constraints]
3432

‎en/1-1000/454-4sum-ii.md‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -19,12 +19,10 @@ Given four integer arrays `nums1`, `nums2`, `nums3`, and `nums4` all of length `
1919

2020
**Explanation**:
2121

22-
```
2322
The two tuples are:
2423

2524
1. (0, 0, 0, 1) -> nums1[0] + nums2[0] + nums3[0] + nums4[1] = 1 + (-2) + (-1) + 2 = 0
2625
2. (1, 1, 0, 0) -> nums1[1] + nums2[1] + nums3[0] + nums4[0] = 2 + (-1) + (-1) + 0 = 0
27-
```
2826

2927
###[Example 2]
3028

‎en/1-1000/707-design-linked-list.md‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -30,15 +30,13 @@ Implement the `MyLinkedList` class:
3030

3131
**Explanation**:
3232

33-
```
3433
MyLinkedList myLinkedList = new MyLinkedList();
3534
myLinkedList.addAtHead(1);
3635
myLinkedList.addAtTail(3);
3736
myLinkedList.addAtIndex(1, 2); // linked list becomes 1->2->3
3837
myLinkedList.get(1); // return 2
3938
myLinkedList.deleteAtIndex(1); // now the linked list is 1->3
4039
myLinkedList.get(1); // return 3
41-
```
4240

4341
###[Constraints]
4442

‎en/1-1000/833-find-and-replace-in-string.md‎

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -34,10 +34,8 @@ A **substring** is a contiguous sequence of characters in a string.
3434

3535
**Explanation**:
3636

37-
```
3837
"a" occurs at index 0 in s, so we replace it with "eee".
3938
"cd" occurs at index 2 in s, so we replace it with "ffff".
40-
```
4139

4240
###[Example 2]
4341

@@ -49,10 +47,8 @@ A **substring** is a contiguous sequence of characters in a string.
4947

5048
**Explanation**:
5149

52-
```
5350
"ab" occurs at index 0 in s, so we replace it with "eee".
5451
"ec" does not occur at index 2 in s, so we do nothing.
55-
```
5652

5753
###[Constraints]
5854

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp