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

Commita0cf398

Browse files
committed
Fixed readmes.
1 parentb0f0467 commita0cf398

File tree

12 files changed

+12
-12
lines changed
  • src/main/java
    • g0701_0800/s0773_sliding_puzzle
    • g0801_0900/s0803_bricks_falling_when_hit
    • g0901_1000/s0934_shortest_bridge
    • g1001_1100
    • g1201_1300
      • s1263_minimum_moves_to_move_a_box_to_their_target_location
      • s1293_shortest_path_in_a_grid_with_obstacles_elimination
    • g1301_1400
      • s1301_number_of_paths_with_max_score
      • s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid
    • g1501_1600/s1568_minimum_number_of_days_to_disconnect_island
    • g1701_1800/s1728_cat_and_mouse_ii
    • g1901_2000/s1958_check_if_move_is_legal

12 files changed

+12
-12
lines changed

‎src/main/java/g0701_0800/s0773_sliding_puzzle/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -95,7 +95,7 @@ public class Solution {
9595
Set<String> seen=newHashSet<>();
9696
Queue<Node> q=newLinkedList<>();
9797
q.add(newNode(sb.toString(),0, y, x));
98-
int[][] dir= {{1,0}, {-1,0}, {0,1}, {0,-1}};
98+
int[][] dir= {{1,0}, {-1,0}, {0,1}, {0,-1}};
9999
while (!q.isEmpty()) {
100100
Node next= q.poll();
101101
String s= next.board;

‎src/main/java/g0801_0900/s0803_bricks_falling_when_hit/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -75,7 +75,7 @@ Hence the result is [0,0].
7575

7676
```java
7777
publicclassSolution {
78-
privatefinalint[][] dirs= {{1,0}, {-1,0}, {0,1}, {0,-1}};
78+
privatefinalint[][] dirs= {{1,0}, {-1,0}, {0,1}, {0,-1}};
7979

8080
publicint[]hitBricks(int[][]grid,int[][]hits) {
8181
int cols= grid[0].length;

‎src/main/java/g0901_1000/s0934_shortest_bridge/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -51,7 +51,7 @@ public class Solution {
5151
}
5252
}
5353

54-
privateint[][] dirs= {{1,0}, {0,1}, {-1,0}, {0,-1}};
54+
privateint[][] dirs= {{1,0}, {0,1}, {-1,0}, {0,-1}};
5555

5656
publicintshortestBridge(int[][]grid) {
5757
ArrayDeque<Pair> q=newArrayDeque<>();

‎src/main/java/g1001_1100/s1001_grid_illumination/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -66,7 +66,7 @@ public class Solution {
6666
int cell= row1* n+ col1;
6767
cellno.put(cell, cellno.getOrDefault(cell,0)+1);
6868
}
69-
int[][] dir= {{-1,0}, {-1,1}, {0,1}, {1,1}, {1,0}, {1,-1}, {0,-1}, {-1,-1}};
69+
int[][] dir= {{-1,0}, {-1,1}, {0,1}, {1,1}, {1,0}, {1,-1}, {0,-1}, {-1,-1}};
7070
int[] ans=newint[queries.length];
7171
for (int i=0; i< queries.length; i++) {
7272
int row1= queries[i][0];

‎src/main/java/g1001_1100/s1041_robot_bounded_in_circle/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -97,7 +97,7 @@ Based on that, we return true.
9797
```java
9898
publicclassSolution {
9999
publicbooleanisRobotBounded(Stringinstructions) {
100-
int[][] dir= {{0,1}, {-1,0}, {0,-1}, {1,0}};
100+
int[][] dir= {{0,1}, {-1,0}, {0,-1}, {1,0}};
101101
int i=0;
102102
int x=0;
103103
int y=0;

‎src/main/java/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -80,7 +80,7 @@ public class Solution {
8080
privateint n;
8181
privateint m;
8282
privatechar[][] grid;
83-
privatefinalint[][] dirs= {{1,0}, {0,1}, {-1,0}, {0,-1}};
83+
privatefinalint[][] dirs= {{1,0}, {0,1}, {-1,0}, {0,-1}};
8484

8585
publicintminPushBox(char[][]grid) {
8686
n= grid.length;

‎src/main/java/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -51,7 +51,7 @@ public class Solution {
5151
return0;
5252
}
5353
// 4 potential moves:
54-
int[][] moves= {{1,0}, {-1,0}, {0,1}, {0,-1}};
54+
int[][] moves= {{1,0}, {-1,0}, {0,1}, {0,-1}};
5555
int m= grid.length;
5656
int n= grid[0].length;
5757
// use obs to record the min total obstacles when traverse to the position

‎src/main/java/g1301_1400/s1301_number_of_paths_with_max_score/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -38,7 +38,7 @@ In case there is no path, return `[0, 0]`.
3838
importjava.util.List;
3939

4040
publicclassSolution {
41-
privatestaticfinalint[][]DIRECTIONS=newint[][] {{1,0}, {0,1}, {1,1}};
41+
privatestaticfinalint[][]DIRECTIONS=newint[][] {{1,0}, {0,1}, {1,1}};
4242

4343
publicint[]pathsWithMaxScore(List<String>board) {
4444
int rows= board.size();

‎src/main/java/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -60,7 +60,7 @@ import java.util.Objects;
6060
importjava.util.Queue;
6161

6262
publicclassSolution {
63-
privatefinalint[][] dir=newint[][] {{0,0}, {0,1}, {0,-1}, {1,0}, {-1,0}};
63+
privatefinalint[][] dir=newint[][] {{0,0}, {0,1}, {0,-1}, {1,0}, {-1,0}};
6464

6565
publicintminCost(int[][]grid) {
6666
int[][] visited=newint[grid.length][grid[0].length];

‎src/main/java/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -45,7 +45,7 @@ import java.util.List;
4545

4646
@SuppressWarnings("java:S107")
4747
publicclassSolution {
48-
privatefinalint[][] dirs= {{0,1}, {0,-1}, {1,0}, {-1,0}};
48+
privatefinalint[][] dirs= {{0,1}, {0,-1}, {1,0}, {-1,0}};
4949

5050
publicintminDays(int[][]grid) {
5151
int m= grid.length;

‎src/main/java/g1701_1800/s1728_cat_and_mouse_ii/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -109,7 +109,7 @@ public class Solution {
109109
}
110110

111111
privateList<Integer>[]buildGraph(intjump,String[]grid) {
112-
int[][] dirs= {{-1,0}, {1,0}, {0,1}, {0,-1}};
112+
int[][] dirs= {{-1,0}, {1,0}, {0,1}, {0,-1}};
113113
int m= grid.length;
114114
int n= grid[0].length();
115115
List<Integer>[] graph=newList[m* n];

‎src/main/java/g1901_2000/s1958_check_if_move_is_legal/readme.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -66,7 +66,7 @@ Given two integers `rMove` and `cMove` and a character `color` representing the
6666
publicclassSolution {
6767

6868
privatestaticfinalint[][]DIRS=
69-
newint[][] {{-1,-1}, {-1,0}, {-1,1}, {0,-1}, {0,1}, {1,-1}, {1,0}, {1,1}};
69+
newint[][] {{-1,-1}, {-1,0}, {-1,1}, {0,-1}, {0,1}, {1,-1}, {1,0}, {1,1}};
7070

7171
publicbooleancheckMove(char[][]board,intrMove,intcMove,charcolor) {
7272
char opposite= (color=='W'?'B': (color=='B'?'W':''));

0 commit comments

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