Package adt

Examples of adt.ListNode

26
27
28
29
30
31
32
public class Q010_Insert_In_Sorted_List {
 
  public static void main(String[] args) {
    int[] arr = {1, 2, 3, 5, 7, 9};
    LinkedList list = new LinkedList(arr);
    insert(list, new ListNode(6));
  }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
  static void insert(LinkedList list, ListNode node) {
    if (list == null || node == null) {
      return;
    }
   
    ListNode head = list.head;
   
    if (head == null || head.val >= node.val ) {
      node.next = head;
      head = node;
    } else {
      ListNode current = head;
      while (current.next != null && current.next.val < node.val) {
        current = current.next;
      }
      node.next = current.next;
      current.next = node;
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
49
50
  static ListNode reverse(ListNode head, int k) {
    if (head == null) {
      return null;
    }
   
    ListNode curr = head;
    ListNode next = null;
    ListNode prev = null;
   
    int count = 0;
   
    // reverse first k nodes of the linked list
    while (curr != null && count < k) {
View Full Code Here
21
22
23
24
25
26
27
28
public class Q040_Reverse_alternate_nodes_and_append_at_the_end {

  public static void main(String[] args) {
    LinkedList list = new LinkedList(6);
    ListNode head = rearrange(list.head);
    head.print();
  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
43
  static ListNode rearrange(ListNode head) {
    if (head == null) {
      return null;
    }
   
    ListNode fa = new ListNode();
    ListNode pa = fa, pb = null;
   
    ListNode curr = head, next = null;
   
    int count = 1;
    while (curr != null) {
      next = curr.next;
     
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
  static void splitList(LinkedList list) {
    if (list == null) {
      return;
    }
   
    ListNode a = new ListNode();
    ListNode pa = a;
    ListNode b = new ListNode();
    ListNode pb = b;
   
    ListNode node = list.head;
    while (node != null) {
      if (node.val == 0) {
        pa.next = node;
        pa = node;
      } else {
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
  public static void main(String[] args) {
    LinkedList a = new LinkedList(new int[]{10, 15, 4, 20});
    LinkedList b = new LinkedList(new int[]{8, 4, 2, 10});
   
    ListNode intersection = getIntersection(a.head, b.head);
    ListNode union = getUnion(a.head, b.head);
   
    intersection.print();
    union.print();
  }
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
 
  // ----------------------------
  //  Intersection
  // ----------------------------
  static ListNode getIntersection(ListNode l1, ListNode l2) {
    ListNode a = l1;
    ListNode b = l2;
   
    // use a hashmap to store visited nodes
    Set<Integer> set = new HashSet<Integer>();
   
    // use a fake head
    ListNode fh = new ListNode();
    ListNode p = fh;
   
    // step 1. go through list a
    while (a != null) {
      // avoid duplication
      if (!set.contains(a.val)) {
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
 
  // ----------------------------
  //  Union
  // ----------------------------
  static ListNode getUnion(ListNode l1, ListNode l2) {
    ListNode a = l1;
    ListNode b = l2;
   
    // use a hashmap to store visited nodes
    Set<Integer> set = new HashSet<Integer>();
   
    // use a fake head
    ListNode fh = new ListNode();
    ListNode p = fh;
   
    // step 1. go through list a
    while (a != null) {
      if (!set.contains(a.val)) {
        set.add(a.val);
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
  // ----------------------
  //  Iterative
  // ----------------------
 
  static void reverse(LinkedList list) {
    ListNode head = list.head;
   
    ListNode prev = null;
    ListNode curr = head;
    ListNode next = null;
   
    while (curr != null) {
      next = curr.next;
      curr.next = prev;
      prev = curr;
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.