Skip to content

Commit a3c90d4

Browse files
committed
fix hyperlink
1 parent c753a34 commit a3c90d4

File tree

4 files changed

+8
-8
lines changed

4 files changed

+8
-8
lines changed

deque/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Deque
22

3-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
3+
[뒤로 가기](https://github.com/nadarm/42-algorithm)
44

55
## index
66
1. [deque(linked list)](./deque_linked_list)
@@ -17,4 +17,4 @@
1717
- array로 deque를 구현하려면?
1818

1919

20-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
20+
[뒤로 가기](https://github.com/nadarm/42-algorithm)

linked_list/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Linked List
22

3-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
3+
[뒤로 가기](https://github.com/nadarm/42-algorithm)
44

55
## index
66
1. [singly linked list](./singly_linked_list)
@@ -19,4 +19,4 @@ array를 사용하면 더 쉬울 수도 있지만 실습을 위해 linked list
1919
- array와 linked list의 차이점
2020

2121

22-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
22+
[뒤로 가기](https://github.com/nadarm/42-algorithm)

queue/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Queue
22

3-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
3+
[뒤로 가기](https://github.com/nadarm/42-algorithm)
44

55
## index
66
1. [queue(array)](./queue_array)
@@ -19,4 +19,4 @@
1919
- array로 queue를 효율성 있게 구현하려면?
2020

2121

22-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
22+
[뒤로 가기](https://github.com/nadarm/42-algorithm)

stack/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Stack
22

3-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
3+
[뒤로 가기](https://github.com/nadarm/42-algorithm)
44

55
## index
66
1. [stack(array)](./stack_array)
@@ -21,4 +21,4 @@
2121
- stack이 사용되는 상황
2222

2323

24-
[뒤로 가기](https://github.com/nadarm/42-algo-basic)
24+
[뒤로 가기](https://github.com/nadarm/42-algorithm)

0 commit comments

Comments
 (0)