Package adt

Examples of adt.ListNode

27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
  static ListNode getIntersection(ListNode h1, ListNode h2) {
    if (h1 == null || h2 == null) {
      return null;
    }
   
    ListNode head = new ListNode();
    ListNode prev = head;
   
    ListNode n1 = h1, n2 = h2;
   
    while (n1 != null && n2 != null) {
      if (n1.val == n2.val) {
        ListNode node = new ListNode(n1.val);
        prev.next = node;
        prev = node;
       
        n1 = n1.next;
        n2 = n2.next;
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
  public static void main(String[] args) {
   
  }
 
  static ListNode insertSortedCLL(ListNode head, ListNode node) {
    ListNode current = head;
   
    // case 1, linkes list is empty
    if (head == null) {
      node.next = node;
      head = node;
View Full Code Here
24
25
26
27
28
29
30
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
62
63
64
65
66
67
68
  static void copyLinkedList(LinkedList list) {
    if (list == null || list.head == null) {
      return;
    }
   
    ListNode node = list.head;
    ListNode copy = null;
    ListNode next = null;
   
    // step 1. insert copy nodes after each original node
    while (node != null) {
      next = node.next;
      copy = new ListNode(node.val);
      copy.next = next;
      node.next = copy;
      node = next;
    }
   
    list.print();
   
    // step 2. copy arbit pointer
    node = list.head;
   
    while (node != null && node.next != null) {
      next = node.next.next;
      //node.next.arbit = node.arbit.next;
      node = next;
    }
   
    // step 3. cut the linked list
    node = list.head;
    ListNode copy_head = node.next;
   
    while (node != null && node.next != null) {
      copy = node.next;
      next = node.next.next;
     
      node.next = next;
      copy.next = (copy.next == null) ? null : copy.next.next;
     
      node = next;
    }
   
    copy_head.print();
  }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
      node.next = node.next.next;
      return;
    }
   
    // then we have to find the node from the head
    ListNode curr = head;
   
    while (curr.next != node) {
      curr = curr.next;
    }
   
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
public class Q004_Nth_Node_From_The_End_Of_A_Linked_List {
 
  public static void main(String[] args) {
    LinkedList list = new LinkedList(10);
   
    ListNode node = lastNthNode(list.head, 3);
   
    if (node != null) {
      System.out.println(node.val);
    } else {
      System.out.println("No such node");
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
      System.out.println("No such node");
    }
  }
 
  static ListNode lastNthNode(ListNode head, int n) {
    ListNode slow = head;
    ListNode fast = head;
   
    // fast先走n步
    int count = 0;
    while (fast != null && count < n) {
      count++;
View Full Code Here
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
public class Q007_Detect_Loop_In_A_Linked_List {

  public static void main(String[] args) {
    LinkedList list = new LinkedList();
   
    ListNode node1 = list.append(1);
    ListNode node2 = list.append(2);
    ListNode node3 = list.append(3);
    ListNode node4 = list.append(4);
    ListNode node5 = list.append(5);
   
    // make a loop
    node5.next = node2;
   
    boolean res = detectLoop(list);
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
  static boolean detectLoop(LinkedList list) {
    if (list == null || list.head == null) {
      return false;
    }
   
    ListNode head = list.head;
    ListNode fast = head;
    ListNode slow = head;
   
    while (fast != null && fast.next != null) {
      slow = slow.next;
      fast = fast.next.next;
     
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
88
89
    if (head.next == null) {
      return new TreeNode(head.val);
    }
   
    // step 1. find the middle node
    ListNode prev = null;
    ListNode slow = head;
    ListNode fast = head;
   
    while (fast != null && fast.next != null) {
      prev = slow;
      slow = slow.next;
      fast = fast.next.next;
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
  static void pairSwap(LinkedList list) {
    if (list == null) {
      return;
    }
   
    ListNode node = list.head;
   
    while (node != null && node.next != null) {
      swap(node, node.next);
      node = node.next.next;
    }
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.