001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
package algs13;
import java.text.DecimalFormat;
import stdlib.*;

/* 
 * Complete the methods below.
 * All of these methods modify the list.
 * Use the function checkInvariants to ensure that your list is well-formed after you modify it.
 * Note that this list keeps track of the number of elements N.
 * It is important that N accurately reflect the length of the list. 
 * 
 * You may not add any fields to the node or list classes.
 * You may not add any methods to the node class.
 * You may not create any new nodes or other objects.
 * For example, you cannot create a new Stack or ArrayList.
 * 
 * Each function must be independent.  
 * For example, you cannot call delete to implement remove.
 * You MAY add private methods to the list class (helper functions for the recursion). 
 */
public class MyLinked2 {
  static class Node {
    public Node (double item, Node next) { this.item = item; this.next = next; }
    public double item;
    public Node next;
  }
  int N;
  Node first;

  // delete the kth element (where k is between 0 and N-1 inclusive)
  public void delete (int k) {
    if (k < 0 || k >= N) throw new IllegalArgumentException ();
    // TODO 
  }

  // reverse the list "in place"... 
  public void reverse () {
    // TODO 
  }

  // remove all occurrences of item from the list 
  public void remove (double item) {
    // TODO 
  }

  public static void main (String args[]) {
    mainDebug ();
    //mainRunTests ();
  }
  private static void mainDebug () {
    // Use this for debugging!
    // Add the names of helper functions if you use them.
    Trace.drawStepsOfMethod ("delete");
    Trace.drawStepsOfMethod ("reverse");
    Trace.drawStepsOfMethod ("remove");
    Trace.run (); 
    // TODO:  Put the test here you want to debug:
    testDelete (2, "11 21 31 41", "[ 11 21 41 ]");
  }
  private static void mainRunTests () {
    // Trace.run (); // uncomment this to get drawings in showError
    testDelete (0, "", "java.lang.IllegalArgumentException");
    testDelete(-1, "11 21 31", "java.lang.IllegalArgumentException");
    testDelete (3, "11 21 31", "java.lang.IllegalArgumentException");
    testDelete (0, "11", "[ ]");
    testDelete (0, "11 21 31 41", "[ 21 31 41 ]");
    testDelete (1, "11 21 31 41", "[ 11 31 41 ]");
    testDelete (2, "11 21 31 41", "[ 11 21 41 ]");
    testDelete (3, "11 21 31 41", "[ 11 21 31 ]");
    testDelete (0, "11 21 31 41 51", "[ 21 31 41 51 ]");
    testDelete (1, "11 21 31 41 51", "[ 11 31 41 51 ]");
    testDelete (2, "11 21 31 41 51", "[ 11 21 41 51 ]");
    testDelete (3, "11 21 31 41 51", "[ 11 21 31 51 ]");
    testDelete (4, "11 21 31 41 51", "[ 11 21 31 41 ]");
    testReverse ("", "[ ]");
    testReverse ("11", "[ 11 ]");
    testReverse ("11 21", "[ 21 11 ]");
    testReverse ("11 21 31", "[ 31 21 11 ]");
    testReverse ("11 21 31 41", "[ 41 31 21 11 ]");
    testReverse ("11 21 31 41 51", "[ 51 41 31 21 11 ]");
    testRemove (5, "", "[ ]");
    testRemove (5, "5", "[ ]");
    testRemove (5, "5 5", "[ ]");
    testRemove (5, "5 5 5", "[ ]");
    testRemove (5, "11", "[ 11 ]");
    testRemove (5, "11 21", "[ 11 21 ]");
    testRemove (5, "11 21 31", "[ 11 21 31 ]");
    testRemove (5, "5 11 21 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "5 5 11 21 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "5 5 5 11 21 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 31 41 5", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 31 41 5 5", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 31 41 5 5 5", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 5 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 5 5 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 5 5 5 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "5 11 21 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "5 5 11 21 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "5 5 5 11 21 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 31 41 5", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 31 41 5 5", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 31 41 5 5 5", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 5 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 5 5 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "11 21 5 5 5 31 41", "[ 11 21 31 41 ]");
    testRemove (5, "5 5 5 11 5 5 21 5 31 5 5 41 5 5 5", "[ 11 21 31 41 ]");
    testRemove (5.1, "5.1 5.1 5.1 5 11 5.1 5.1 21 5.1 31 5.1 5.1 41 5.1 5.1 5.1", "[ 5 11 21 31 41 ]");
    StdOut.println ("Finished tests");
  }
  
  /* ToString method to print */
  public String toString () { 
    // Use DecimalFormat #.### rather than String.format 0.3f to leave off trailing zeroes
    DecimalFormat format = new DecimalFormat ("#.###");
    StringBuilder result = new StringBuilder ("[ ");
    for (Node x = first; x != null; x = x.next) {
      result.append (format.format (x.item));
      result.append (" ");
    }
    result.append ("]");
    return result.toString ();
  }

  /* Method to create lists */
  public static MyLinked2 of(String s) {
    int N = 0;
    Node first = null;
    String[] nums = s.split (" ");
    for (int i = nums.length-1; i >= 0; i--) {
      try { 
        double num = Double.parseDouble (nums[i]); 
        first = new Node (num, first);  
        N++;
      } catch (NumberFormatException e) {
        // ignore anything that is not a double
      }
    }
    MyLinked2 result = new MyLinked2 ();
    result.first = first;
    result.N = N;
    return result;
  }
  
  static void showError (String message) {
    Trace.draw ();
    StdOut.println (message);
    //throw new Error (); // stops execution
  }
  private static void checkInvariants (String message, MyLinked2 list) {
    MyLinked2.Node x = list.first;
    int N = list.N;
    for (int i = 0; i < N; i++) {
      if (x == null) {
        showError (String.format ("%s: Expected %d nodes, but got less.", message, N));
        return;
      }
      x = x.next;
    }
    if (x != null) {
      showError (String.format ("%s: Expected %d nodes, but got more.", message, N));
    }
  }
  private static void check (String message, MyLinked2 actual, String expected) {
    checkInvariants (message, actual);
    if (!expected.equals (actual.toString ())) {
      showError (String.format ("%s: expected=%s, actual=%s", message, expected, actual.toString ()));
    }
  }
  private static void testDelete (int k, String list, String expected) {
    MyLinked2 actual = MyLinked2.of (list);
    String message = String.format ("[ %s ].delete( %d )", list, k);
    try {
      actual.delete (k);
    } catch (Throwable e) {
      String exception = e.getClass ().getName ();
      if (! exception.equals (expected)) {
        e.printStackTrace (); // for debugging
        showError (String.format ("%s: expected=%s, actual=%s", message, expected, exception));
      }
      return;
    }
    check (message, actual, expected);
  }
  private static void testReverse (String list, String expected) {
    MyLinked2 actual = MyLinked2.of (list);
    actual.reverse ();
    String message = String.format ("[ %s ].reverse( )", list);
    check (message, actual, expected);
  }
  private static void testRemove (double item, String list, String expected) {
    MyLinked2 actual = MyLinked2.of (list);
    actual.remove (item);
    String message = String.format ("[ %s ].remove( %.2f )", list, item);
    check (message, actual, expected);
  }
}