// Program to test solutions to problem #9 on the cse143 final, spring 2013.
// Fill in your solution to reverse3, then compile and run the program

import java.util.*;

class LinkedIntList {
    public void reverse3() {
        // fill in your solution here
    }

    private ListNode front;  // first value in the list

    // this is the sample solution
    public void reverse32() {
        if (front != null && front.next != null && front.next.next != null) {
            ListNode temp = front;
            front = front.next.next;
            ListNode temp2 = front.next;
            front.next = temp.next;
            temp.next.next = temp;
            temp.next = temp2;
            while (temp.next != null && temp.next.next != null &&
                   temp.next.next.next != null) {
                temp2 = temp.next;
                temp.next = temp.next.next.next;
                temp = temp2;
                temp2 = temp.next.next.next;
                temp.next.next.next = temp.next;
                temp.next.next = temp;
                temp.next = temp2;
            }
        }
    }

    // post: constructs an empty list
    public LinkedIntList() {
        front = null;
    }

    // post: returns the current number of elements in the list
    public int size() {
        int count = 0;
        ListNode current = front;
        while (current != null) {
            current = current.next;
            count++;
        }
        return count;
    }

    // pre : 0 <= index < size()
    // post: returns the integer at the given index in the list
    public int get(int index) {
        ListNode current = front;
        for (int i = 0; i < index; i++)
            current = current.next;
        return current.data;
    }

    // post: creates a comma-separated, bracketed version of the list
    public String toString() {
        if (front == null)
            return "[]";
        else {
            String result = "[" + front.data;
            ListNode current = front.next;
            while (current != null) {
                result += ", " + current.data;
                current = current.next;
            }
            result += "]";
            return result;
        }
    }

    // post : returns the position of the first occurence of the given
    //        value (-1 if not found)
    public int indexOf(int value) {
        int index = 0;
        ListNode current = front;
        while (current !=  null) {
            if (current.data == value)
                return index;
            index++;
            current = current.next;
        }
        return -1;
    }

    // post: appends the given value to the end of the list
    public void add(int value) {
        if (front == null)
            front = new ListNode(value);
        else {
            ListNode current = front;
            while (current.next != null)
                current = current.next;
            current.next = new ListNode(value);
        }
    }

    // pre: 0 <= index <= size()
    // post: inserts the given value at the given index, shifting subsequent
    //       values right
    public void add(int index, int value) {
        if (index == 0)
            front = new ListNode(value, front);
        else {
            ListNode current = front;
            for (int i = 0; i < index - 1; i++)
                current = current.next;
            current.next = new ListNode(value, current.next);
        }
    }

    // pre : 0 <= index < size()
    // post: removes value at the given index, shifting subsequent values left
    public void remove(int index) {
        if (index == 0)
            front = front.next;
        else {
            ListNode current = front;
            for (int i = 0; i < index - 1; i++)
                current = current.next;
            current.next = current.next.next;
        }
    }
}

public class FinalTest9 {
    private static int[] cases = {0, 1, 2, 3, 6, 9, 7, 8, 10, 11};
    private static int count = 0;  // test counter for arrays
    private static int totalFail = 0;

    public static void main(String[] args) {
        for (int n : cases)
            test(n);

        if (totalFail > 0) {
            System.out.println("failed " + totalFail + " of " + count + 
                               " tests");
            System.out.println();
        } else {
            System.out.println("passed all tests");
        }
    }

    public static void test(int size) {
        LinkedIntList list1 = new LinkedIntList();
        LinkedIntList list2 = new LinkedIntList();
        for (int i = 0; i < size; i++) {
            list1.add(11 + i);
            list2.add(11 + i);
        }
        boolean fail = false;
        System.out.println("testing length " + cases[count]);
        System.out.println("list     = " + list1);
        list1.reverse32();
        System.out.println("expected = " + list1);
        boolean threw = false;
        try {
            list2.reverse3();
        } catch (RuntimeException e) {
            int line = e.getStackTrace()[0].getLineNumber();
            System.out.println("    threw " + e + " at line #" + line);
            threw = true;
        }
        String str1 = list1.toString();
        String str2 = list2.toString();
        if (!fail && !str1.equals(str2)) {
            System.out.println("actual   = " + list2);
            fail = true;
        }
        if (fail || threw) {
            System.out.println("failed");
            totalFail++;
        } else {
            System.out.println("passed");
        }
        System.out.println();
        count++;  // increment test counter
    }
}

class ListNode {
    public int data;       // data stored in this node
    public ListNode next;  // link to next node in the list

    // post: constructs a node with data 0 and null link
    public ListNode() {
        this(0, null);
    }

    // post: constructs a node with given data and null link
    public ListNode(int data) {
        this(data, null);
    }

    // post: constructs a node with given data and given link
    public ListNode(int data, ListNode next) {
        this.data = data;
        this.next = next;
    }
}