Skip to content

Commit 08daf75

Browse files
Update README.md
1 parent 05362c8 commit 08daf75

File tree

1 file changed

+4
-1
lines changed

1 file changed

+4
-1
lines changed

algorithm-1/README.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -20,16 +20,19 @@ The state of the board is solved if and only if the board is [[1,2,3],[4,5,0]].
2020
Given the puzzle board board, return the least number of moves required so that the state of the board is solved. If it is impossible for the state of the board to be solved, return -1.
2121

2222
![image](https://user-images.githubusercontent.com/33912144/236757486-1de6785a-06a7-4d53-a7cb-3684a55b99b7.png)
23+
2324
Girdi: board = [[1,2,3],[4,0,5]]
2425
Çıktı: 1
2526
Açıklama: Bir hamlede 0 ve 5'i değiştirin.
2627

2728
![image](https://user-images.githubusercontent.com/33912144/236757638-1fe80d5a-d079-4c35-a2cb-0b31c292edf6.png)
29+
2830
Girdi: board = [[1,2,3],[5,4,0]]
2931
Çıktı: -1
3032
Açıklama: Hiçbir hamle sayısı tahtayı çözülmüş hale getirmeyecektir.
3133

3234
![image](https://user-images.githubusercontent.com/33912144/236757814-d4944172-e8a2-4e91-b46b-e0cbfd36d06f.png)
35+
3336
Girdi: board = [[4,1,2],[5,0,3]]
3437
Çıktı: 5
3538
Açıklama: 5, tahtayı çözen en küçük hamle sayısıdır.
@@ -42,7 +45,7 @@ Bir örnek yol:
4245
5. hamleden sonra: [[1,2,0],[4,5,3]]
4346
6. hamleden sonra: [[1,2,3],[4,5,0]]
4447

45-
Kısıtlamalar:
48+
## Kısıtlamalar:
4649

4750
board.length == 2
4851
board[i].length == 3

0 commit comments

Comments
 (0)