Beispiel #1
0
 public static void main(String[] args) {
   Node n = new Node(0);
   n.appendToTail(2);
   n.appendToTail(2);
   n.appendToTail(3);
   n.appendToTail(4);
   n.appendToTail(3);
   n.appendToTail(2);
   n.appendToTail(2);
   n.appendToTail(0);
   System.out.println(isPalindrome(n));
 }
 /** @param args */
 public static void main(String[] args) {
   // TODO Auto-generated method stub
   Node head = new Node(0);
   head.appendToTail(1);
   head.appendToTail(5);
   head.appendToTail(6);
   head.appendToTail(2);
   head.appendToTail(3);
   head.appendToTail(4);
   deleteNode(head);
   Node cur = head;
   while (cur != null) {
     System.out.println(cur.data);
     cur = cur.next;
   }
 }
Beispiel #3
0
  /** @param args */
  public static void main(String[] args) {
    Node head = new Node();

    for (int i = 0; i < 16; i++) {
      head.appendToTail(i);
    }
    System.out.println(head.toStringInt());
    //		Node result = reverseInGroup(head,4);
    Node result = reverse(head);
    System.out.println(result.toStringInt());
  }
Beispiel #4
0
  public static void main(String[] args) throws IOException, Whoops {

    System.out.print(
        "Enter a number k where k will be the kth-to-last element of "
            + "a linked list (the default one provided has 8 nodes): ");
    BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
    String inputString = input.readLine();
    int k = Integer.parseInt(inputString);

    Node f = new Node(5);
    f.appendToTail(4);
    f.appendToTail(8);
    f.appendToTail(8);
    f.appendToTail(6);
    f.appendToTail(8);
    f.appendToTail(9);
    f.appendToTail(4);

    f.printList();

    Node kthToLast = f.findKthToLast(f, k);

    System.out.println("The kth-to-last element is: " + kthToLast.data);
  }
  public static void main(String[] args) {
    // TODO Auto-generated method stub
    if (args.length == 0) {
      System.out.println("Please input at least one number!");
    }

    Node head = new Node(Integer.parseInt(args[0]));
    Node temp = head;
    for (int i = 1; i < args.length; i++) {
      head.appendToTail(Integer.parseInt(args[i]));
    }

    while (head.next != null) {
      System.out.print(head.getData() + " ");
      head = head.next;
    }
    System.out.println(head.getData());
    System.out.println();

    //		head.next = temp.next.next.next;
    //		Node startOfLoop = circleLinkedList(temp);
    //		System.out.println("Start of loop is " + startOfLoop.getData());
    //

    boolean isPalindrome = palindrome(temp);
    if (isPalindrome) {
      System.out.println("This is a palindrome linkedlist");
    } else {
      System.out.println("This is not a palindrome linkedlist");
    }

    // Node newHead = addLinkedList(p1, p2);

    // Node newHead = partition(temp, 5);
    //		deleteFromMiddle(nthToLast(temp, args.length - 5));
    //		Node newHead = temp;
    //		while(newHead != null) {
    //			System.out.print(newHead.getData() + " ");
    //			newHead = newHead.next;
    //		}
    //
    //		System.out.println();
    // Node result = nthToLast(temp, args.length - 1);
    // System.out.println(result.getData());

  }
Beispiel #6
0
 public static void main(String args[]) {
   Node node = new Node(10);
   node.appendToTail(1999);
   System.out.println(node.data + " " + node.next.data);
 }