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

Commit80f9525

Browse files
committed
Updated readmes.
1 parent0917dd8 commit80f9525

File tree

310 files changed

+820
-819
lines changed

Some content is hidden

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

310 files changed

+820
-819
lines changed

‎src/main/java/g0001_0100/s0023_merge_k_sorted_lists/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ _Merge all the linked-lists into one sorted linked-list and return it._
88

99
**Example 1:**
1010

11-
**Input:** lists =[[1,4,5],[1,3,4],[2,6]]
11+
**Input:** lists =\[\[1,4,5],[1,3,4],[2,6]]
1212

1313
**Output:**[1,1,2,3,4,4,5,6]
1414

@@ -22,7 +22,7 @@ _Merge all the linked-lists into one sorted linked-list and return it._
2222

2323
**Example 3:**
2424

25-
**Input:** lists =[[]]
25+
**Input:** lists =\[\[]]
2626

2727
**Output:**[]
2828

‎src/main/java/g0001_0100/s0037_sudoku_solver/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ The `'.'` character indicates empty cells.
1818

1919
**Input:**
2020

21-
board = [["5","3",".",".","7",".",".",".","."],
21+
board = [["5","3",".",".","7",".",".",".","."],
2222
["6",".",".","1","9","5",".",".","."],
2323
[".","9","8",".",".",".",".","6","."],
2424
["8",".",".",".","6",".",".",".","3"],

‎src/main/java/g0001_0100/s0048_rotate_image/readme.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -10,27 +10,27 @@ You have to rotate the image [**in-place**](https://en.wikipedia.org/wiki/In-pla
1010

1111
![](https://assets.leetcode.com/uploads/2020/08/28/mat1.jpg)
1212

13-
**Input:** matrix =[[1,2,3],[4,5,6],[7,8,9]]
13+
**Input:** matrix =\[\[1,2,3],[4,5,6],[7,8,9]]
1414

1515
**Output:**[[7,4,1],[8,5,2],[9,6,3]]
1616

1717
**Example 2:**
1818

1919
![](https://assets.leetcode.com/uploads/2020/08/28/mat2.jpg)
2020

21-
**Input:** matrix =[[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]
21+
**Input:** matrix =\[\[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]
2222

2323
**Output:**[[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]
2424

2525
**Example 3:**
2626

27-
**Input:** matrix =[[1]]
27+
**Input:** matrix =\[\[1]]
2828

2929
**Output:**[[1]]
3030

3131
**Example 4:**
3232

33-
**Input:** matrix =[[1,2],[3,4]]
33+
**Input:** matrix =\[\[1,2],[3,4]]
3434

3535
**Output:**[[3,1],[4,2]]
3636

‎src/main/java/g0001_0100/s0054_spiral_matrix/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,15 +8,15 @@ Given an `m x n` `matrix`, return _all elements of the_ `matrix` _in spiral orde
88

99
![](https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg)
1010

11-
**Input:** matrix =[[1,2,3],[4,5,6],[7,8,9]]
11+
**Input:** matrix =\[\[1,2,3],[4,5,6],[7,8,9]]
1212

1313
**Output:**[1,2,3,6,9,8,7,4,5]
1414

1515
**Example 2:**
1616

1717
![](https://assets.leetcode.com/uploads/2020/11/13/spiral.jpg)
1818

19-
**Input:** matrix =[[1,2,3,4],[5,6,7,8],[9,10,11,12]]
19+
**Input:** matrix =\[\[1,2,3,4],[5,6,7,8],[9,10,11,12]]
2020

2121
**Output:**[1,2,3,4,8,12,11,10,9,5,6,7]
2222

‎src/main/java/g0001_0100/s0056_merge_intervals/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -6,15 +6,15 @@ Given an array of `intervals` where <code>intervals[i] = [start<sub>i</sub>, end
66

77
**Example 1:**
88

9-
**Input:** intervals =[[1,3],[2,6],[8,10],[15,18]]
9+
**Input:** intervals =\[\[1,3],[2,6],[8,10],[15,18]]
1010

1111
**Output:**[[1,6],[8,10],[15,18]]
1212

1313
**Explanation:** Since intervals[1,3] and[2,6] overlaps, merge them into[1,6].
1414

1515
**Example 2:**
1616

17-
**Input:** intervals =[[1,4],[4,5]]
17+
**Input:** intervals =\[\[1,4],[4,5]]
1818

1919
**Output:**[[1,5]]
2020

‎src/main/java/g0001_0100/s0057_insert_interval/readme.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -10,13 +10,13 @@ Return `intervals` _after the insertion_.
1010

1111
**Example 1:**
1212

13-
**Input:** intervals =[[1,3],[6,9]], newInterval =[2,5]
13+
**Input:** intervals =\[\[1,3],[6,9]], newInterval =[2,5]
1414

1515
**Output:**[[1,5],[6,9]]
1616

1717
**Example 2:**
1818

19-
**Input:** intervals =[[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval =[4,8]
19+
**Input:** intervals =\[\[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval =[4,8]
2020

2121
**Output:**[[1,2],[3,10],[12,16]]
2222

@@ -30,13 +30,13 @@ Return `intervals` _after the insertion_.
3030

3131
**Example 4:**
3232

33-
**Input:** intervals =[[1,5]], newInterval =[2,3]
33+
**Input:** intervals =\[\[1,5]], newInterval =[2,3]
3434

3535
**Output:**[[1,5]]
3636

3737
**Example 5:**
3838

39-
**Input:** intervals =[[1,5]], newInterval =[2,7]
39+
**Input:** intervals =\[\[1,5]], newInterval =[2,7]
4040

4141
**Output:**[[1,7]]
4242

‎src/main/java/g0001_0100/s0063_unique_paths_ii/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ An obstacle and space is marked as `1` and `0` respectively in the grid.
1414

1515
![](https://assets.leetcode.com/uploads/2020/11/04/robot1.jpg)
1616

17-
**Input:** obstacleGrid =[[0,0,0],[0,1,0],[0,0,0]]
17+
**Input:** obstacleGrid =\[\[0,0,0],[0,1,0],[0,0,0]]
1818

1919
**Output:** 2
2020

@@ -24,7 +24,7 @@ An obstacle and space is marked as `1` and `0` respectively in the grid.
2424

2525
![](https://assets.leetcode.com/uploads/2020/11/04/robot2.jpg)
2626

27-
**Input:** obstacleGrid =[[0,1],[0,0]]
27+
**Input:** obstacleGrid =\[\[0,1],[0,0]]
2828

2929
**Output:** 1
3030

‎src/main/java/g0001_0100/s0064_minimum_path_sum/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,15 +10,15 @@ Given a `m x n` `grid` filled with non-negative numbers, find a path from top le
1010

1111
![](https://assets.leetcode.com/uploads/2020/11/05/minpath.jpg)
1212

13-
**Input:** grid =[[1,3,1],[1,5,1],[4,2,1]]
13+
**Input:** grid =\[\[1,3,1],[1,5,1],[4,2,1]]
1414

1515
**Output:** 7
1616

1717
**Explanation:** Because the path 1 → 3 → 1 → 1 → 1 minimizes the sum.
1818

1919
**Example 2:**
2020

21-
**Input:** grid =[[1,2,3],[4,5,6]]
21+
**Input:** grid =\[\[1,2,3],[4,5,6]]
2222

2323
**Output:** 12
2424

‎src/main/java/g0001_0100/s0073_set_matrix_zeroes/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,15 +10,15 @@ You must do it [in place](https://en.wikipedia.org/wiki/In-place_algorithm).
1010

1111
![](https://assets.leetcode.com/uploads/2020/08/17/mat1.jpg)
1212

13-
**Input:** matrix =[[1,1,1],[1,0,1],[1,1,1]]
13+
**Input:** matrix =\[\[1,1,1],[1,0,1],[1,1,1]]
1414

1515
**Output:**[[1,0,1],[0,0,0],[1,0,1]]
1616

1717
**Example 2:**
1818

1919
![](https://assets.leetcode.com/uploads/2020/08/17/mat2.jpg)
2020

21-
**Input:** matrix =[[0,1,2,0],[3,4,5,2],[1,3,1,5]]
21+
**Input:** matrix =\[\[0,1,2,0],[3,4,5,2],[1,3,1,5]]
2222

2323
**Output:**[[0,0,0,0],[0,4,5,0],[0,3,1,0]]
2424

‎src/main/java/g0001_0100/s0074_search_a_2d_matrix/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,15 +11,15 @@ Write an efficient algorithm that searches for a value in an `m x n` matrix. Thi
1111

1212
![](https://assets.leetcode.com/uploads/2020/10/05/mat.jpg)
1313

14-
**Input:** matrix =[[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
14+
**Input:** matrix =\[\[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
1515

1616
**Output:** true
1717

1818
**Example 2:**
1919

2020
![](https://assets.leetcode.com/uploads/2020/10/05/mat2.jpg)
2121

22-
**Input:** matrix =[[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
22+
**Input:** matrix =\[\[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
2323

2424
**Output:** false
2525

‎src/main/java/g0001_0100/s0079_word_search/readme.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,23 +10,23 @@ The word can be constructed from letters of sequentially adjacent cells, where a
1010

1111
![](https://assets.leetcode.com/uploads/2020/11/04/word2.jpg)
1212

13-
**Input:** board =[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
13+
**Input:** board =\[\["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED"
1414

1515
**Output:** true
1616

1717
**Example 2:**
1818

1919
![](https://assets.leetcode.com/uploads/2020/11/04/word-1.jpg)
2020

21-
**Input:** board =[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"
21+
**Input:** board =\[\["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE"
2222

2323
**Output:** true
2424

2525
**Example 3:**
2626

2727
![](https://assets.leetcode.com/uploads/2020/10/15/word3.jpg)
2828

29-
**Input:** board =[["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"
29+
**Input:** board =\[\["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB"
3030

3131
**Output:** false
3232

‎src/main/java/g0001_0100/s0085_maximal_rectangle/readme.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ Given a `rows x cols` binary `matrix` filled with `0`'s and `1`'s, find the larg
88

99
![](https://assets.leetcode.com/uploads/2020/09/14/maximal.jpg)
1010

11-
**Input:** matrix =[["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
11+
**Input:** matrix =\[\["1","0","1","0","0"],["1","0","1","1","1"],["1","1","1","1","1"],["1","0","0","1","0"]]
1212

1313
**Output:** 6
1414

@@ -22,19 +22,19 @@ Given a `rows x cols` binary `matrix` filled with `0`'s and `1`'s, find the larg
2222

2323
**Example 3:**
2424

25-
**Input:** matrix =[["0"]]
25+
**Input:** matrix =\[\["0"]]
2626

2727
**Output:** 0
2828

2929
**Example 4:**
3030

31-
**Input:** matrix =[["1"]]
31+
**Input:** matrix =\[\["1"]]
3232

3333
**Output:** 1
3434

3535
**Example 5:**
3636

37-
**Input:** matrix =[["0","0"]]
37+
**Input:** matrix =\[\["0","0"]]
3838

3939
**Output:** 0
4040

‎src/main/java/g0101_0200/s0120_triangle/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ For each step, you may move to an adjacent number of the row below. More formall
88

99
**Example 1:**
1010

11-
**Input:** triangle =[[2],[3,4],[6,5,7],[4,1,8,3]]
11+
**Input:** triangle =\[\[2],[3,4],[6,5,7],[4,1,8,3]]
1212

1313
**Output:** 11
1414

@@ -23,7 +23,7 @@ For each step, you may move to an adjacent number of the row below. More formall
2323

2424
**Example 2:**
2525

26-
**Input:** triangle =[[-10]]
26+
**Input:** triangle =\[\[-10]]
2727

2828
**Output:** -10
2929

‎src/main/java/g0101_0200/s0130_surrounded_regions/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,15 +10,15 @@ A region is **captured** by flipping all `'O'`s into `'X'`s in that surrounded r
1010

1111
![](https://assets.leetcode.com/uploads/2021/02/19/xogrid.jpg)
1212

13-
**Input:** board =[["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
13+
**Input:** board =\[\["X","X","X","X"],["X","O","O","X"],["X","X","O","X"],["X","O","X","X"]]
1414

1515
**Output:**[["X","X","X","X"],["X","X","X","X"],["X","X","X","X"],["X","O","X","X"]]
1616

1717
**Explanation:** Surrounded regions should not be on the border, which means that any 'O' on the border of the board are not flipped to 'X'. Any 'O' that is not on the border and it is not connected to an 'O' on the border will be flipped to 'X'. Two cells are connected if they are adjacent cells connected horizontally or vertically.
1818

1919
**Example 2:**
2020

21-
**Input:** board =[["X"]]
21+
**Input:** board =\[\["X"]]
2222

2323
**Output:**[["X"]]
2424

‎src/main/java/g0101_0200/s0133_clone_graph/readme.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ The given node will always be the first node with `val = 1`. You must return the
2222

2323
![](https://assets.leetcode.com/uploads/2019/11/04/133_clone_graph_question.png)
2424

25-
**Input:** adjList =[[2,4],[1,3],[2,4],[1,3]]
25+
**Input:** adjList =\[\[2,4],[1,3],[2,4],[1,3]]
2626

2727
**Output:**[[2,4],[1,3],[2,4],[1,3]]
2828

@@ -38,7 +38,7 @@ The given node will always be the first node with `val = 1`. You must return the
3838

3939
![](https://assets.leetcode.com/uploads/2020/01/07/graph.png)
4040

41-
**Input:** adjList =[[]]
41+
**Input:** adjList =\[\[]]
4242

4343
**Output:**[[]]
4444

@@ -56,7 +56,7 @@ The given node will always be the first node with `val = 1`. You must return the
5656

5757
![](https://assets.leetcode.com/uploads/2020/01/07/graph-1.png)
5858

59-
**Input:** adjList =[[2],[1]]
59+
**Input:** adjList =\[\[2],[1]]
6060

6161
**Output:**[[2],[1]]
6262

‎src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/readme.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -21,23 +21,23 @@ Your code will **only** be given the `head` of the original linked list.
2121

2222
![](https://assets.leetcode.com/uploads/2019/12/18/e1.png)
2323

24-
**Input:** head =[[7,null],[13,0],[11,4],[10,2],[1,0]]
24+
**Input:** head =\[\[7,null],[13,0],[11,4],[10,2],[1,0]]
2525

2626
**Output:**[[7,null],[13,0],[11,4],[10,2],[1,0]]
2727

2828
**Example 2:**
2929

3030
![](https://assets.leetcode.com/uploads/2019/12/18/e2.png)
3131

32-
**Input:** head =[[1,1],[2,1]]
32+
**Input:** head =\[\[1,1],[2,1]]
3333

3434
**Output:**[[1,1],[2,1]]
3535

3636
**Example 3:**
3737

3838
**![](https://assets.leetcode.com/uploads/2019/12/18/e3.png)**
3939

40-
**Input:** head =[[3,null],[3,0],[3,null]]
40+
**Input:** head =\[\[3,null],[3,0],[3,null]]
4141

4242
**Output:**[[3,null],[3,0],[3,null]]
4343

‎src/main/java/g0101_0200/s0149_max_points_on_a_line/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,15 +8,15 @@ Given an array of `points` where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>
88

99
![](https://assets.leetcode.com/uploads/2021/02/25/plane1.jpg)
1010

11-
**Input:** points =[[1,1],[2,2],[3,3]]
11+
**Input:** points =\[\[1,1],[2,2],[3,3]]
1212

1313
**Output:** 3
1414

1515
**Example 2:**
1616

1717
![](https://assets.leetcode.com/uploads/2021/02/25/plane2.jpg)
1818

19-
**Input:** points =[[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
19+
**Input:** points =\[\[1,1],[3,2],[5,3],[4,1],[2,3],[1,4]]
2020

2121
**Output:** 4
2222

‎src/main/java/g0101_0200/s0174_dungeon_game/readme.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -18,15 +18,15 @@ Return _the knight's minimum initial health so that he can rescue the princess_.
1818

1919
![](https://assets.leetcode.com/uploads/2021/03/13/dungeon-grid-1.jpg)
2020

21-
**Input:** dungeon =[[-2,-3,3],[-5,-10,1],[10,30,-5]]
21+
**Input:** dungeon =\[\[-2,-3,3],[-5,-10,1],[10,30,-5]]
2222

2323
**Output:** 7
2424

2525
**Explanation:** The initial health of the knight must be at least 7 if he follows the optimal path: RIGHT-> RIGHT -> DOWN -> DOWN.
2626

2727
**Example 2:**
2828

29-
**Input:** dungeon =[[0]]
29+
**Input:** dungeon =\[\[0]]
3030

3131
**Output:** 1
3232

0 commit comments

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