본문 바로가기

Basic/자료구조,알고리즘

양방향 연결리스트(Doubly LinkedList) api 예제

반응형

1. 양방향 LinkedList api


자바는 Doubly LinkedList 를 제공한다. 


https://docs.oracle.com/javase/8/docs/api/java/util/LinkedList.html?noframes=true#LinkedList



2. DoublyLinkedList 예제


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
package DoublyLinkedList;
 
import java.util.LinkedList;
import java.util.ListIterator;
 
public class DoublyLinkedListApi {
 
    public static void main(String[] args) {
 
        LinkedList LinkedList = new LinkedList();
        
        LinkedList.add(1);
        LinkedList.add(3);
        LinkedList.add(2);
        LinkedList.add(4);
        LinkedList.add(5);
    
        ListIterator i = LinkedList.listIterator();
        
        while(i.hasNext()){
             System.out.println(i.next());
          }
        System.out.println();
        
        boolean a = LinkedList.remove((Object)2);//2값을 가진 노드 삭제
        
        int index = LinkedList.indexOf(1);//x값의 가진 노드의 인덱스를 반환, 0번째 위치 반환
        
        LinkedList.add(index,0);//index에 해당하는 위치에 값0을 가진 노드를 추가한다
        LinkedList.add(index,2);
        
        ListIterator k = LinkedList.listIterator();
        
        while(k.hasNext()){
             System.out.println(k.next());
          }
    }
}
 

cs


1
2
3
4
5
6
7
8
9
10
11
12
1
3
2
4
5
 
2
0
1
3
4
5
cs


반응형