Package adt

Examples of adt.ListNode

30
31
32
33
34
35
36
37
public class Q025_Add_Two_Numbers_Represented_By_Linked_Lists {
 
  public static void main(String[] args) {
    LinkedList a = new LinkedList(new int[]{5, 6, 3, 4});
    LinkedList b = new LinkedList(new int[]{8, 4, 2, 9});
    ListNode c = add(a.head, b.head);
    c.print();
  }
View Full Code Here
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
69
70
71
72
    c.print();
  }
 
  static ListNode add(ListNode a, ListNode b) {
    // create a fake head
    ListNode fc = new ListNode();
    ListNode pc = fc;
   
    int carry = 0, sum = 0;
   
    ListNode node = null;
   
    while (a != null || b != null) {
      sum = ((a == null) ? 0 : a.val) + ((b == null) ? 0 : b.val) + carry;
      carry = sum / 10;
      sum = sum % 10;
     
      node = new ListNode(sum);
      pc.next = node;
      pc = node;
     
      if (a != null) {
        a = a.next;
      }
     
      if (b != null) {
        b = b.next;
      }
    }
   
    if (carry > 0) {
      node = new ListNode(carry);
      pc.next = node;
      pc = node;
    }
   
    pc.next = null;
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
  static void skipMdeleteN(ListNode head, int M, int N) {
    if (head == null) {
      return;
    }
   
    ListNode curr = head;
   
    while (curr != null) {
      // skip M nodes
      for (int i = 1; i < M && curr != null; i++) {
        curr = curr.next;
      }
     
      // If we reached end of list, then return
      if (curr == null) {
        return;
      }
     
      // Start from next node and delete N nodes
      ListNode t = curr.next;
      for (int i = 1; i <= N && t != null; i++) {
        t = t.next;
      }
     
      // Link the previous list with remaining nodes
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
37
  static void removeDups(LinkedList list) {
    if (list == null || list.head == null) {
      return;
    }
   
    ListNode slow = list.head;
    ListNode fast = slow.next;
   
    while (fast != null) {
      if (fast.val != slow.val) {
        slow.next = fast;
        slow = fast;
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
 
  /**
   * Insert new node to the end
   */
  public ListNode append(int x) {
    ListNode node = new ListNode(x);
   
    if (head == null) {
      head = node;
      tail = node;
    } else {
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
 
  @Override
  public String toString() {
    StringBuilder sb = new StringBuilder();
   
    ListNode p = head;
    while (p != null) {
      sb.append(p.val);
      p = p.next;
     
      if (p != null) {
View Full Code Here
92
93
94
95
96
97
98
99
100
  // ---------------------------
  //  Merge Sort
  // ---------------------------
 
  public void mergeSort(boolean ascending) {
    ListNode h = head;
    head = mergeSort(h, ascending);
    print();
  }
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
    if (h == null || h.next == null) {
      return h;
    }
   
    // find the middle node
    ListNode prev = null;
    ListNode slow = h;
    ListNode fast = h;
   
    while (fast != null && fast.next != null) {
      prev = slow;
      slow = slow.next;
      fast = fast.next.next;
    }
   
    prev.next = null;
   
    ListNode left = mergeSort(h, ascending);
    ListNode right = mergeSort(slow, ascending);
   
    return mergeLists(left, right, ascending);
  }
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
133
134
135
   
    return mergeLists(left, right, ascending);
  }
 
  private ListNode mergeLists(ListNode l1, ListNode l2, boolean ascending) {
    ListNode fakeHead = new ListNode();
    ListNode p = fakeHead;
   
    ListNode a = l1, b = l2;
   
    if (ascending) {
      while (a != null && b != null) {
        if (a.val < b.val) {
          p.next = a;
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
   
    findSumTriple(a.head, b.head, c.head, 101);
  }
 
  static void findSumTriple(ListNode l1, ListNode l2, ListNode l3, int target) {
    ListNode a = l1, b, c;
   
    while (a != null) {
      b = l2;
      c = l3;
     
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.