Intersection Study - Algorithm[List]
•
0 likes•499 views
Before studying algorithm you need to know some data structures
Recommended
More Related Content
What's hot
What's hot (12)
Similar to Intersection Study - Algorithm[List]
Similar to Intersection Study - Algorithm[List] (20)
Recently uploaded
Recently uploaded (20)
Intersection Study - Algorithm[List]
- 1. ALGORITHM
- 3. ALGORITHM LIST INTRO What is List?
- 5. 학교 게시판 공지사항 리스트 LIST INTRO ALGORITHM
- 7. 15773 제거 15771 15770 … 15765 15764 15773 15771 15770 … 15765 15764 비어 있음 Delete Issue LIST INTRO ALGORITHM
- 8. Insert Issue 15773 15772 15771 15770 … 15765 15764 15774 15773 15772 15771 … 15765 15764 Insert front 15773 15772 15771 15770 … 15765 15764 15773 15772 15771 15770 … 15766 15765 Insert specific position LIST INTRO ALGORITHM
- 9. createList 리스트 생성 deleteList 리스트 삭제 isFull 리스트의 여유 공간이 있는가? addElement 리스트 내 특정 위치에 원소 추가 removeElement 리스트 내 특정 위치의 원소 제거 clearList 리스트 내 모든 원소 제거 getListLength 리스트 내 원소의 수 getElement 리스트 내 특정 위치의 원소 Total Issue LIST INTRO ALGORITHM
- 10. 1 2 3 4 Two Kinds of List 1 2 3 4 5 0 1 2 3 4 6 5 LIST INTRO ALGORITHM
- 11. Array List 1 2 3 4 5 0 1 2 3 4 6 5 LIST ARRAY LIST ALGORITHM
- 12. 최대 원소 개수 (maxElementCount) 현재 원소 개수 (CurrentElementCount) 원소 배열 포인터 (pElement) ArrayList data data data data … 0 1 2 3 … data (maxElementCount – 1) 원소 (data) ArrayListNode Two Structures LIST ARRAY LIST ALGORITHM
- 13. data data … data 0 1 … curElementCount – 1 원소 추가 가능 Insert Range LIST ARRAY LIST ALGORITHM
- 14. Push and Insert LIST ARRAY LIST data 1 2 3 4 curElementCount – 1 position position + 1 ALGORITHM
- 15. Push and Insert LIST ARRAY LIST data 1 2 3 4 4 curElementCount – 1 position position + 1 ALGORITHM
- 16. Push and Insert LIST ARRAY LIST data 1 2 3 3 4 curElementCount – 1 position position + 1 ALGORITHM
- 17. Push and Insert LIST ARRAY LIST data 1 2 2 3 4 curElementCount – 1 position position + 1 ALGORITHM
- 18. Push and Insert LIST ARRAY LIST data 1 1 2 3 4 curElementCount – 1 position position + 1 ALGORITHM
- 19. Push and Insert LIST ARRAY LIST data 1 1 2 3 4 new curElementCount – 1 ALGORITHM
- 20. Delete and Pull LIST ARRAY LIST data 0 1 2 3 4 1 curElementCount – 1 position position + 1 ALGORITHM
- 21. Delete and Pull LIST ARRAY LIST data 0 2 2 3 4 curElementCount – 1 position position + 1 ALGORITHM 1
- 22. Delete and Pull LIST ARRAY LIST data 0 2 3 3 4 curElementCount – 1 position position + 1 ALGORITHM 1
- 23. Delete and Pull LIST ARRAY LIST data 0 2 3 4 4 curElementCount – 1 position position + 1 ALGORITHM 1
- 24. Delete and Pull LIST ARRAY LIST data 0 2 3 4 curElementCount – 1 position position + 1 ALGORITHM 1
- 25. Delete and Pull LIST ARRAY LIST data 0 2 3 4 curElementCount – 1 position position + 1 ALGORITHM 1 return
- 26. Linked List 1 2 3 4 LIST LINKED LIST ALGORITHM
- 27. LIST LINKED LIST Linked List Node 자료(Data) 링크(Link) ALGORITHM
- 28. Various Linked List LIST LINKED LIST Linked List Circular List Doubly Linked List ALGORITHM
- 29. Linked List LIST LINKED LIST Linked List ALGORITHM
- 30. Two Structures LIST LINKED LIST 현재 원소 개수 (CurrentElementCount) LinkedList data pLink Header Node data pLink ListNode ListNode ALGORITHM
- 31. LIST LINKED LIST Insert Node LinkedList data pLink Header Node data pLink position-1 data pLink position … data pLink newNode ALGORITHM
- 32. LIST LINKED LIST Insert Node LinkedList data pLink Header Node data pLink position-1 data pLink position … data pLink newNode ALGORITHM
- 33. LIST LINKED LIST Insert Node LinkedList data pLink Header Node data pLink position-1 data pLink position … data pLink newNode ALGORITHM
- 34. LIST LINKED LIST Delete Node LinkedList data pLink Header Node data pLink position-1 data pLink position+1 … data pLink position ALGORITHM
- 35. LIST LINKED LIST Delete Node LinkedList data pLink Header Node data pLink position-1 data pLink position+1 … data pLink position ALGORITHM
- 36. LIST LINKED LIST Delete Node LinkedList data pLink Header Node data pLink position-1 data pLink position+1 … data pLink position ALGORITHM NULL
- 37. LIST LINKED LIST Delete Node LinkedList data pLink Header Node data pLink position-1 data pLink position+1 … data pLink position ALGORITHM NULL return
- 38. Circular List LIST CIRCULAR LIST Circular List ALGORITHM
- 39. Two Structures LIST CIRCULAR LIST 현재 원소 개수 (CurrentElementCount) CircularList pLink data pLink ListNode data pLink ListNode … ALGORITHM
- 40. Insert Issue LIST CIRCULAR LIST Case 1-1 Case 1-2 curElementCount 0? yes No Case 2 First Insert? yes No ALGORITHM
- 41. Insert case 1-1 LIST CIRCULAR LIST CircularList pLink NULL pLink ListNode ALGORITHM
- 42. Insert case 1-1 LIST CIRCULAR LIST CircularList pLink NULL pLink ListNode ALGORITHM
- 43. Insert case 1-1 LIST CIRCULAR LIST CircularList pLink NULL pLink ListNode ALGORITHM
- 44. CircularList pLink pLink newNode pLink first pLink last … Insert case 1-2 ALGORITHM LIST CIRCULAR LIST
- 45. CircularList pLink pLink newNode pLink first pLink last … Insert case 1-2 ALGORITHM LIST CIRCULAR LIST
- 46. CircularList pLink pLink newNode pLink first pLink last … Insert case 1-2 ALGORITHM LIST CIRCULAR LIST
- 47. CircularList pLink pLink newNode pLink first pLink last … Insert case 1-2 ALGORITHM LIST CIRCULAR LIST
- 48. CircularList pLink pLink newNode pLink first pLink last … Insert case 1-2 ALGORITHM LIST CIRCULAR LIST
- 49. CircularList pLink pLink first pLink position-1 pLink position Insert case 1-2 ALGORITHM LIST CIRCULAR LIST … pLink newNode
- 50. CircularList pLink pLink first pLink position-1 pLink position Insert case 1-2 ALGORITHM LIST CIRCULAR LIST … pLink newNode
- 51. CircularList pLink pLink first pLink position-1 pLink position Insert case 1-2 ALGORITHM LIST CIRCULAR LIST … pLink newNode
- 52. CircularList pLink pLink first pLink position-1 pLink position Insert case 1-2 ALGORITHM LIST CIRCULAR LIST … pLink newNode
- 53. Delete Issue ALGORITHM LIST CIRCULAR LIST Case 1-1 Case 1-2 Case 2 First Node Delete? curElementCount 1? yes yes No No
- 54. CircularList pLink Delete case 1-1 ALGORITHM LIST CIRCULAR LIST pLink ListNode NULL
- 55. CircularList pLink Delete case 1-1 ALGORITHM LIST CIRCULAR LIST pLink ListNode NULL
- 56. CircularList pLink Delete case 1-1 ALGORITHM LIST CIRCULAR LIST pLink ListNode NULL return
- 57. ALGORITHM LIST CIRCULAR LIST Delete Case 1-2 CircularList pLink pLink first pLink second pLink last …
- 58. ALGORITHM LIST CIRCULAR LIST Delete Case 1-2 CircularList pLink pLink first pLink second pLink last …
- 59. ALGORITHM LIST CIRCULAR LIST Delete Case 1-2 CircularList pLink pLink first pLink second pLink last …
- 60. ALGORITHM LIST CIRCULAR LIST Delete Case 1-2 CircularList pLink pLink first pLink second pLink last … NULL
- 61. ALGORITHM LIST CIRCULAR LIST Delete Case 1-2 CircularList pLink pLink first pLink second pLink last … NULL return
- 62. ALGORITHM LIST CIRCULAR LIST Delete Case 1-3 CircularList pLink pLink position-1 pLink position pLink position+1 ……
- 63. ALGORITHM LIST CIRCULAR LIST Delete Case 1-3 CircularList pLink pLink position-1 pLink position pLink position+1 ……
- 64. ALGORITHM LIST CIRCULAR LIST Delete Case 1-3 CircularList pLink pLink position-1 pLink position pLink position+1 …… NULL
- 65. ALGORITHM LIST CIRCULAR LIST Delete Case 1-3 CircularList pLink pLink position-1 pLink position pLink position+1 …… NULL return
- 66. Doubly Linked List ALGORITHM LIST Doubly Linked List Doubly Linked List
- 67. Doubly Linked List Node 자료(Data) 오른쪽 링크 (Right Link) 왼쪽 링크 (Left Link) ALGORITHM LIST Doubly Linked List
- 68. Doubly Linked List DoublyList data pRLink Header Node pLLink ALGORITHM LIST Doubly Linked List
- 69. LinkedList data pRLink Header Node pRLink position-1 pRLink newNode Insert Node pRLink position pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … …
- 70. LinkedList data pRLink Header Node pRLink position-1 pRLink newNode Insert Node pRLink position pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … …
- 71. LinkedList data pRLink Header Node pRLink position-1 pRLink newNode Insert Node pRLink position pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … …
- 72. LinkedList data pRLink Header Node pRLink position-1 pRLink newNode Insert Node pRLink position pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … …
- 73. LinkedList data pRLink Header Node pRLink position-1 pRLink newNode Insert Node pRLink position pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … …
- 74. LinkedList data pRLink Header Node pRLink position-1 pRLink newNode Insert Node pRLink position pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … …
- 75. LinkedList data pRLink Header Node pRLink position-1 pRLink position pRLink position+1 pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … … Delete Node
- 76. LinkedList data pRLink Header Node pRLink position-1 pRLink position pRLink position+1 pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … … Delete Node
- 77. LinkedList data pRLink Header Node pRLink position-1 pRLink position pRLink position+1 pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … … Delete Node
- 78. LinkedList data pRLink Header Node pRLink position-1 pRLink position pRLink position+1 pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … … Delete Node
- 79. LinkedList data pRLink Header Node pRLink position-1 pRLink position pRLink position+1 pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … … Delete Node NULL
- 80. LinkedList data pRLink Header Node pRLink position-1 pRLink position pRLink position+1 pLLink pLLink pLLink pLLink ALGORITHM LIST Doubly Linked List … … pRLink last pLLink … … Delete Node NULL return