Package CtCILibrary

Examples of CtCILibrary.LinkedListNode

40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
    int k = 10;
   
    // Create linked list
    LinkedListNode[] nodes = new LinkedListNode[list_length];
    for (int i = 0; i < list_length; i++) {
      nodes[i] = new LinkedListNode(i, null, i > 0 ? nodes[i - 1] : null);
    }
   
    // Create loop;
    nodes[list_length - 1].next = nodes[list_length - k];
   
    LinkedListNode loop = FindBeginning(nodes[0]);
    if (loop == null) {
      System.out.println("No Cycle.");
    } else {
      System.out.println(loop.data);
    }
View Full Code Here
7
8
9
10
11
12
13
14
15
16
  public static boolean deleteNode(LinkedListNode n) {
    if (n == null || n.next == null) {
      return false; // Failure
    }
    LinkedListNode next = n.next;
    n.data = next.data;
    n.next = next.next;
    return true;
  }
View Full Code Here
14
15
16
17
18
19
20
21
22
23
    n.next = next.next;
    return true;
  }
 
  public static void main(String[] args) {
    LinkedListNode head = AssortedMethods.randomLinkedList(10, 0, 10);
    System.out.println(head.printForward());
    deleteNode(head.next.next.next.next); // delete node 4
    System.out.println(head.printForward());
  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
    }
  }
 
  public boolean isPalindrome(LinkedListNode head) {
    int size = 0;
    LinkedListNode n = head;
    while (n != null) {
      size++;
      n = n.next;
    }
    Result p = isPalindromeRecurse(head, size);
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
 
  public static void main(String[] args) {
    int length = 10;
    LinkedListNode[] nodes = new LinkedListNode[length];
    for (int i = 0; i < length; i++) {
      nodes[i] = new LinkedListNode(i >= length / 2 ? length - i - 1 : i, null, null);
    }
   
    for (int i = 0; i < length; i++) {
      if (i < length - 1) {
        nodes[i].setNext(nodes[i + 1]);
      }
      if (i > 0) {
        nodes[i].setPrevious(nodes[i - 1]);
      }
    }
    // nodes[length - 2].data = 9; // Uncomment to ruin palindrome
   
    LinkedListNode head = nodes[0];
    System.out.println(head.printForward());
    Question q = new Question();
    System.out.println(q.isPalindrome(head));
  }
View Full Code Here
TOP

Related Classes of CtCILibrary.LinkedListNode

  • Question2_1.Question
  • Question2_3.Question
  • Question2_4.Question
  • Question2_4.QuestionB
  • Question2_4.QuestionC
  • Question2_5.QuestionA
  • Question2_5.QuestionB
  • Question2_6.Question
  • Question2_7.Question
  • Question2_7.QuestionB
    • 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.