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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
package algs13;
import java.text.DecimalFormat;
import stdlib.*;

/* 
 * Complete the methods below.
 * None of the methods should modify the list, unless that is the purpose of the method.
 * 
 * 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: you cannot call one solution function from the other.  
 * You MAY add private methods to the list class (helper functions for the recursion). 
 */
public class MyLinked1 {
  static class Node {
    public Node (double item, Node next) { this.item = item; this.next = next; }
    public double item;
    public Node next;
  }
  Node first;


  // write a function to compute the size of the list, using a loop
  // empty list has size 0
  public int sizeLoop () {
    return StdRandom.uniform (100); //TODO: fix this
  }

  // write a function to compute the size of the list, using an optimistic, forward recursion
  // empty list has size 0
  public int sizeForward () {
    return StdRandom.uniform (100); //TODO: fix this
  }

  // write a function to compute the size of the list, using an optimistic, backward recursion
  // empty list has size 0
  public int sizeBackward () {
    return StdRandom.uniform (100); //TODO: fix this
  }

  // compute the position of the first 5.0 in the list, counting as an offset from the beginning.  
  // if 5.0 is the FIRST element, the position is 0
  // if 5.0 does not appear, return a negative number
  // you can write this using a loop or recursion, in any style, but you should only have one loop or recursive helper
  // I would expect
  // [0,1,2,5,5,5,5,5,8,9].positionOfFirstFiveFromBeginning() == 3
  // [0,1,2,5,5,5,5,5,8,9].positionOfLastFiveFromEnd() == 2
  public int positionOfFirstFiveFromBeginning () {
    return StdRandom.uniform (100); //TODO: fix this
  }

  // compute the position of the last 5.0 in the list, counting as an offset from the end.  
  // if 5.0 is the LAST element, the position is 0
  // if 5.0 does not appear, return a negative number
  // you can write this using a loop or recursion, in any style, but you should only have one loop or recursive helper
  // Hint: Use a backward recursion.  
  // Hint: If the number does not appear, return the distance to the END of the list as a NEGATIVE number.
  public int positionOfLastFiveFromEnd () {
    return StdRandom.uniform (100); //TODO: fix this
  }

  // delete the first element
  public void deleteFirst () {
    // 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 ("sizeLoop");
    Trace.drawStepsOfMethod ("sizeForward");
    Trace.drawStepsOfMethod ("sizeBackward");
    Trace.drawStepsOfMethod ("positionOfFirstFiveFromBeginning");
    Trace.drawStepsOfMethod ("positionOfLastFiveFromEnd");
    Trace.drawStepsOfMethod ("deleteFirst");
    Trace.run (); 
    // TODO:  Put the test here you want to debug:
    testSizeLoop (4, "11 -21.2 31 41");
  }
  private static void mainRunTests () {
    testSizeLoop (0, "");
    testSizeLoop (1, "11");
    testSizeLoop (2, "11 21");  
    testSizeLoop (4, "11 -21.2 31 41");

    testSizeForward (0, "");
    testSizeForward (1, "11");
    testSizeForward (2, "11 21"); 
    testSizeForward (4, "11 -21.2 31 41");

    testSizeBackward (0, "");
    testSizeBackward (1, "11");
    testSizeBackward (2, "11 21");  
    testSizeBackward (4, "11 -21.2 31 41");

    testPositionOfFirstFiveFromBeginning (-1, "");
    testPositionOfFirstFiveFromBeginning (-1, "11");
    testPositionOfFirstFiveFromBeginning (-1, "11 21 31 41");
    testPositionOfFirstFiveFromBeginning (0, "5 11 21 31 41");
    testPositionOfFirstFiveFromBeginning (1, "11 5 21 31 41");
    testPositionOfFirstFiveFromBeginning (2, "11 21 5 31 41");
    testPositionOfFirstFiveFromBeginning (3, "11 21 31 5 41");
    testPositionOfFirstFiveFromBeginning (4, "11 21 31 41 5");
    testPositionOfFirstFiveFromBeginning (3, "0 1 2 5 5 5 5 5 8 9");

    testPositionOfLastFiveFromEnd (-1, "");
    testPositionOfLastFiveFromEnd (-2, "11");
    testPositionOfLastFiveFromEnd (-5, "11 21 31 41");
    testPositionOfLastFiveFromEnd (4, "5 11 21 31 41");
    testPositionOfLastFiveFromEnd (3, "11 5 21 31 41");
    testPositionOfLastFiveFromEnd (2, "11 21 5 31 41");
    testPositionOfLastFiveFromEnd (1, "11 21 31 5 41");
    testPositionOfLastFiveFromEnd (0, "11 21 31 41 5");
    testPositionOfLastFiveFromEnd (2, "0 1 2 5 5 5 5 5 8 9");
    testPositionOfLastFiveFromEnd (2, "0 1 2 5 5 5 5 5 5 8 9");
    
    testDeleteFirst ("", "11");
    testDeleteFirst ("21", "11 21");  
    testDeleteFirst ("21 31", "11 21 31");  
    testDeleteFirst ("21 11", "31 21 11");  
    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 MyLinked1 of(String s) {
    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);  
      } catch (NumberFormatException e) {
        // ignore anything that is not a double
      }
    }
    MyLinked1 result = new MyLinked1 ();
    result.first = first;
    return result;
  }

  // lots of copy and paste in these test!
  private static void testSizeLoop (int expected, String sList) {
    MyLinked1 list = MyLinked1.of (sList);
    String sStart = list.toString ();
    int actual = list.sizeLoop();
    if (expected != actual) {
      StdOut.format ("Failed %s.sizeLoop(): Expecting (%d) Actual (%d)\n", sStart, expected, actual);
    }
    String sEnd = list.toString ();
    if (! sStart.equals (sEnd)) {
      StdOut.format ("Failed %s.sizeLoop(): List changed to %s\n", sStart, sEnd);
    }
  } 
  private static void testSizeForward (int expected, String sList) {
    MyLinked1 list = MyLinked1.of (sList);
    String sStart = list.toString ();
    int actual = list.sizeForward ();
    if (expected != actual) {
      StdOut.format ("Failed %s.sizeForward(): Expecting (%d) Actual (%d)\n", sStart, expected, actual);
    }
    String sEnd = list.toString ();
    if (! sStart.equals (sEnd)) {
      StdOut.format ("Failed %s.sizeForward(): List changed to %s\n", sStart, sEnd);
    }
  } 
  private static void testSizeBackward (int expected, String sList) {
    MyLinked1 list = MyLinked1.of (sList);
    String sStart = list.toString ();
    int actual = list.sizeBackward ();
    if (expected != actual) {
      StdOut.format ("Failed %s.sizeBackward(): Expecting (%d) Actual (%d)\n", sStart, expected, actual);
    }
    String sEnd = list.toString ();
    if (! sStart.equals (sEnd)) {
      StdOut.format ("Failed %s.sizeBackward(): List changed to %s\n", sStart, sEnd);
    }
  }
  private static void testPositionOfFirstFiveFromBeginning (int expected, String sList) {
    MyLinked1 list = MyLinked1.of (sList);
    String sStart = list.toString ();
    int actual = list.positionOfFirstFiveFromBeginning ();
    //if ((expected >= 0 && expected != actual) || (expected < 0 && actual > 0)) {
    if (expected != actual) {
      StdOut.format ("Failed %s.positionOfFirstFiveFromBeginning(): Expecting (%d) Actual (%d)\n", sStart, expected, actual);
    }
    String sEnd = list.toString ();
    if (! sStart.equals (sEnd)) {
      StdOut.format ("Failed %s.positionOfFirstFiveFromBeginning(): List changed to %s\n", sStart, sEnd);
    }
  }
  private static void testPositionOfLastFiveFromEnd (int expected, String sList) {
    MyLinked1 list = MyLinked1.of (sList);
    String sStart = list.toString ();
    int actual = list.positionOfLastFiveFromEnd ();
    //if ((expected >= 0 && expected != actual) || (expected < 0 && actual > 0)) {
    if (expected != actual) {
      StdOut.format ("Failed %s.testPositionOfLastFiveFromEnd(): Expecting (%d) Actual (%d)\n", sStart, expected, actual);
    }
    String sEnd = list.toString ();
    if (! sStart.equals (sEnd)) {
      StdOut.format ("Failed %s.testPositionOfLastFiveFromEnd(): List changed to %s\n", sStart, sEnd);
    }
  }
  private static void testDeleteFirst (String expected, String sList) {
    String sExpected = MyLinked1.of (expected).toString ();
    MyLinked1 list = MyLinked1.of (sList);
    String sStart = list.toString ();
    list.deleteFirst ();
    String sEnd = list.toString ();
    if (! sExpected.equals (sEnd)) {
      StdOut.format ("Failed %s.deleteFirst(): Expecting %s Actual %s\n", sStart, sExpected, sEnd);
    }
  } 
}