Package adt

Examples of adt.ListNode

31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
    if (list == null || list.head == null) {
      return false;
    }
   
    // get the middle node
    ListNode fast = list.head;
    ListNode slow = list.head;
    ListNode prev = null;
   
    while (fast != null && fast.next != null) {
      prev = slow;
      slow = slow.next;
      fast = fast.next.next;
    }
   
    // 奇数长度, 记录下正中间的点
    // 1  2  3  2  1
    //    p  s     f
    if (fast != null) {
      slow = slow.next;
    }
   
    // 分割成两条链表
    prev.next = null;
   
    // 反转右边一半
    ListNode second_half = reverse(slow);
   
    return compareLists(list.head, second_half);
   
  }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
  static ListNode reverse(ListNode head) {
    if (head == null || head.next == null) {
      return head;
    }
   
    ListNode first = head;
    ListNode rest = head.next;
   
    head = reverse(rest);
   
    first.next.next = first;
    first.next = null;
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
94
   
    if (l1 == null || l2 == null) {
      return false;
    }
   
    ListNode p1 = l1;
    ListNode p2 = l2;
   
    while (p1 != null && p2 != null) {
      if (p1.val == p2.val) {
        p1 = p1.next;
        p2 = p2.next;
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
  static void moveLastToFront(LinkedList list) {
    if (list == null || list.head == null) {
      return;
    }
   
    ListNode prev = null;
    ListNode node = list.head;
   
    while (node.next != null) {
      prev = node;
      node = node.next;
    }
View Full Code Here
28
29
30
31
32
33
34
35
public class Q035A_Swap_Kth_node_from_beginning_with_Kth_node_from_end_in_a_Singly_Linked_List {

  public static void main(String[] args) {
    LinkedList list = new LinkedList(8);
    ListNode head = swap(list.head, 3);
    head.print();
  }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
      }
     
      // Find the kth node from beginning of linked list. We also find
      // previous of kth node because we need to update next pointer of
      // the previous.
      ListNode x = head;
      ListNode x_prev = null;
      for (int i = 1; i < k; i++)
      {
          x_prev = x;
          x = x.next;
      }
     
      // Similarly, find the kth node from end and its previous. kth node
      // from end is (n-k+1)th node from beginning
      ListNode y = head;
      ListNode y_prev = null;
      for (int i = 1; i < n-k+1; i++)
      {
          y_prev = y;
          y = y.next;
      }
     
      // If x_prev exists, then new next of it will be y. Consider the case
      // when y->next is x, in this case, x_prev and y are same. So the statement
      // "x_prev->next = y" creates a self loop. This self loop will be broken
      // when we change y->next.
      //
      //      x_prev   x           y_prev   y
      // 1  ->  2  ->  3  ->  4  ->  5  ->  6  ->  7  ->  8
      //
      //      x_prev   y  
      // 1  ->  2  ->  6  ->  7  ->  8
     
      if (x_prev != null)
          x_prev.next = y;
  
      // Same thing applies to y_prev
      //
      // x           y_prev
      // 3  ->  4  ->  5
      // |             |
      // ------ < ------
     
      if (y_prev != null)
          y_prev.next = x;
     
      // Swap next pointers of x and y. These statements also break self
      // loop if x->next is y or y->next is x
      //
      //      x_prev   y          y_prev   x
      // 1  ->  2  ->  6  ->  4 ->  5  ->  3  ->  7  ->  8
      //
     
      ListNode temp = x.next;
      x.next = y.next;
      y.next = temp;
     
      // Change head pointers when k is 1 or n
      if (k == 1)
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
      return head;
  }
 
  static int countNodes(ListNode head) {
    int n = 0;
    ListNode p = head;
    while (p != null) {
      n++;
      p = p.next;
    }
    return n;
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
public class Q003_Print_The_Middle_Of_A_Given_Linked_List {

  public static void main(String[] args) {
    LinkedList list = new LinkedList(9);
    ListNode middle = getMiddleNode(list.head);
   
    if (middle != null) {
      System.out.println(middle.val);
    } else {
      System.out.println("No such node");
View Full Code Here
27
28
29
30
31
32
33
34
35
36
37
38
      System.out.println("No such node");
    }
  }
 
  static ListNode getMiddleNode(ListNode head) {
    ListNode slow = head;
    ListNode fast = head;
   
    while (fast != null && fast.next != null) {
      slow = slow.next;
      fast = fast.next.next;
    }
View Full Code Here
18
19
20
21
22
23
24
25
public class Q017_Intersection_of_Two_Sorted_Linked_Lists {

  public static void main(String[] args) {
    LinkedList l1 = new LinkedList(new int[]{1, 2, 3, 4, 6});
    LinkedList l2 = new LinkedList(new int[]{2, 4, 6, 8});
    ListNode head = getIntersection(l1.head, l2.head);
    head.print();
  }
View Full Code Here
TOP

Related Classes of adt.ListNode

  • adt.LinkedList
  • problems.geeks.linkedlist.Q001_Get_Nth_Node
  • problems.geeks.linkedlist.Q002_Deleted_Node
  • problems.geeks.linkedlist.Q003_Print_The_Middle_Of_A_Given_Linked_List
  • problems.geeks.linkedlist.Q004_Nth_Node_From_The_End_Of_A_Linked_List
  • problems.geeks.linkedlist.Q006A_Reverse_Singly_Linked_List
  • problems.geeks.linkedlist.Q006C_Reverse_Linked_List_In_Groups_of_Given_Size
  • problems.geeks.linkedlist.Q007_Detect_Loop_In_A_Linked_List
  • problems.geeks.linkedlist.Q008_Check_If_A_Singly_Linked_List_Is_Palindrome
  • problems.geeks.linkedlist.Q009_Copy_Linked_List_With_Next_And_Arbit_Pointer
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.