Bot: Prettified Java code!

Author: neha-peddinti

src/com/codefortomorrow/advanced/chapter14/solutions/Bank.java

@@ -52,6 +52,7 @@ public static void withdraw(BankAccount account, int amount) {
 }
 
 class BankAccount {
+
     private int balance;
 
     public BankAccount(int balance) {

src/com/codefortomorrow/advanced/chapter15/solutions/MeasurableProblem.java

@@ -40,6 +40,7 @@ interface Measurable {
 }
 
 class Student implements Measurable {
+
     private double GPA;
     private String name;
 

src/com/codefortomorrow/advanced/chapter16/practice/Access.java

@@ -1,5 +1,4 @@
 package com.codefortomorrow.advanced.chapter16.practice;
-
 /*
 Using the methods outlined in the “Benefits of LinkedLists” section,
 fill both a LinkedList and an ArrayList with 10,000 elements.

src/com/codefortomorrow/advanced/chapter16/practice/Names.java

@@ -1,5 +1,4 @@
 package com.codefortomorrow.advanced.chapter16.practice;
-
 /*
 Create a LinkedList of Strings, and ask the user to
 input 10 names one by one into the list.

src/com/codefortomorrow/advanced/chapter16/practice/SinglyLinkedListInsert.java

@@ -1,5 +1,4 @@
 package com.codefortomorrow.advanced.chapter16.practice;
-
 /*
 Adding an insert method to a SinglyLinkedList
 (details in SinglyLinkedList DIY section). 

src/com/codefortomorrow/advanced/chapter16/practice/Sort.java

@@ -1,5 +1,4 @@
 package com.codefortomorrow.advanced.chapter16.practice;
-
 /*
 Write a method which takes in a LinkedList of Strings
 and rearranges the elements (without creating a new list)

src/com/codefortomorrow/advanced/chapter16/solutions/Access.java

@@ -1,4 +1,5 @@
 package com.codefortomorrow.advanced.chapter16.solutions;
+
 import java.util.*;
 
 /*
@@ -19,24 +20,21 @@ public static void main(String[] args) {
 
         // Define lists with 10,000 elements.
         LinkedList<Integer> list1 = new LinkedList<Integer>();
-        for(int i = 0; i < 10000; i++)
-            list1.add(1);
+        for (int i = 0; i < 10000; i++) list1.add(1);
 
         ArrayList<Integer> list2 = new ArrayList<Integer>();
-        for(int i = 0; i < 10000; i++)
-            list2.add(1);
+        for (int i = 0; i < 10000; i++) list2.add(1);
 
         // Get time for each operation and output the difference.
         a = System.nanoTime();
         int c = list1.get(9999);
         b = System.nanoTime();
-        System.out.println("\nLinked: " + (b-a) + " ns");
+        System.out.println("\nLinked: " + (b - a) + " ns");
 
         a = System.nanoTime();
         int d = list2.get(9999);
         b = System.nanoTime();
-        System.out.println("ArrayList: " + (b-a) + " ns");
-
+        System.out.println("ArrayList: " + (b - a) + " ns");
         // Note that the ArrayList takes less time.
     }
 }

src/com/codefortomorrow/advanced/chapter16/solutions/Names.java

@@ -1,4 +1,5 @@
 package com.codefortomorrow.advanced.chapter16.solutions;
+
 import java.util.*;
 
 /*
@@ -19,18 +20,19 @@
 */
 
 public class Names {
+
     public static void main(String[] args) {
         LinkedList<String> list = new LinkedList<String>();
         Scanner sc = new Scanner(System.in);
-        for(int i = 0; i < 10; i++) {
-          System.out.print("Enter name " + (i+1) + ": ");
-          list.add(sc.nextLine());
+        for (int i = 0; i < 10; i++) {
+            System.out.print("Enter name " + (i + 1) + ": ");
+            list.add(sc.nextLine());
         }
         System.out.println(list);
 
-        for(int i = 0; i < list.size(); i++)
-          if(list.get(i).length() <= 5)
-                list.remove(i--);
+        for (int i = 0; i < list.size(); i++) if (
+            list.get(i).length() <= 5
+        ) list.remove(i--);
         System.out.println(list);
 
         list.add(0, "Apple");

src/com/codefortomorrow/advanced/chapter16/solutions/SinglyLinkedListInsert.java

@@ -1,4 +1,5 @@
 package com.codefortomorrow.advanced.chapter16.solutions;
+
 import java.util.*;
 
 /*
@@ -36,77 +37,75 @@ Make sure you have a toString() method defined!
 // definition.
 
 public class SinglyLinkedListInsert {
-  Node head;
-
-  // add() method from SinglyLinkedList DIY section, adds to end of list
-  public void add(int data) {
-    // Create a new node with given data 
-    Node new_node = new Node(data); 
-
-    // If the Linked List is empty, 
-    // then make the new node as head 
-    if (head == null) { 
-        head = new_node; 
-    } 
-    else { 
-        // Else traverse till the last node 
-        // and insert the new_node there 
-        Node last = head; 
-        while (last.next != null) { 
-            last = last.next; 
-        } 
-
-        // Insert the new_node at last node 
-        last.next = new_node; 
-    } 
-  }
-
-  public void insert(int data, int pos) {
-    // Verify valid pos number
-    if (pos < 0) 
-      System.out.print("Invalid position"); 
-
-    // Create new node and keep track of current node
-    Node new_node = new Node(data); 
-    Node current = head;
-
-    // If pos is 0, set new node as head
-    if (pos == 0) { 
-      new_node.next = head; 
-      head = new_node; 
-    } else { 
-      while (pos-- >= 0) { 
-        if (pos == 0) { 
-          // Add new node after current position
-          new_node.next = current.next;
-          current.next = new_node;
-          break; 
+
+    Node head;
+
+    // add() method from SinglyLinkedList DIY section, adds to end of list
+    public void add(int data) {
+        // Create a new node with given data
+        Node new_node = new Node(data);
+
+        // If the Linked List is empty,
+        // then make the new node as head
+        if (head == null) {
+            head = new_node;
+        } else {
+            // Else traverse till the last node
+            // and insert the new_node there
+            Node last = head;
+            while (last.next != null) {
+                last = last.next;
+            }
+
+            // Insert the new_node at last node
+            last.next = new_node;
+        }
+    }
+
+    public void insert(int data, int pos) {
+        // Verify valid pos number
+        if (pos < 0) System.out.print("Invalid position");
+
+        // Create new node and keep track of current node
+        Node new_node = new Node(data);
+        Node current = head;
+
+        // If pos is 0, set new node as head
+        if (pos == 0) {
+            new_node.next = head;
+            head = new_node;
+        } else {
+            while (pos-- >= 0) {
+                if (pos == 0) {
+                    // Add new node after current position
+                    new_node.next = current.next;
+                    current.next = new_node;
+                    break;
+                }
+                // Check if pos is out of bounds (reaches end)
+                if (current.next == null) {
+                    System.out.println("Out of bounds");
+                    break;
+                }
+                current = current.next;
+            }
         }
-        // Check if pos is out of bounds (reaches end)
-        if(current.next == null) {
-          System.out.println("Out of bounds");
-          break;
+    }
+
+    @Override
+    public String toString() {
+        // For empty lists
+        if (head == null) return "{}";
+
+        String str = "{";
+
+        // Traverse the list until the last node
+        Node current = head;
+        while (current.next != null) {
+            str += "" + current.data + ", ";
+            current = current.next;
         }
-        current = current.next; 
-      } 
-    } 
-  }
-
-  @Override
-  public String toString() {
-    // For empty lists
-    if(head == null)
-      return "{}";
-
-    String str = "{";
-    
-    // Traverse the list until the last node
-    Node current = head;
-    while(current.next != null) {
-      str += "" + current.data + ", ";
-      current = current.next;
+        str += current.data + "}";
+        return str;
     }
-    str += current.data + "}";
-    return str;
-  }
 }

src/com/codefortomorrow/advanced/chapter16/solutions/Sort.java

@@ -1,4 +1,5 @@
 package com.codefortomorrow.advanced.chapter16.solutions;
+
 import java.util.*;
 
 /*
@@ -9,29 +10,38 @@ and rearranges the elements (without creating a new list)
 */
 
 public class Sort {
+
     public static void main(String[] args) {
         LinkedList<String> list = new LinkedList<String>();
-        list.addAll(Arrays.asList(
-            "Jeannette", "Sophia", "Computer", "Boots",
-            "Lava", "Lasagna", "Dirty", "Cleanie"
-        ));
+        list.addAll(
+            Arrays.asList(
+                "Jeannette",
+                "Sophia",
+                "Computer",
+                "Boots",
+                "Lava",
+                "Lasagna",
+                "Dirty",
+                "Cleanie"
+            )
+        );
         sort(list);
         System.out.println(list);
     }
 
     public static void sort(LinkedList<String> list) {
-        if(list.size() < 2) return;
-        for(int i = 1; i < list.size(); i++) {
+        if (list.size() < 2) return;
+        for (int i = 1; i < list.size(); i++) {
             String current = list.get(i);
             // Check if current word is smaller than previous word
-            if(current.length() < list.get(i-1).length()) {
+            if (current.length() < list.get(i - 1).length()) {
                 // Add current word before the node with
                 // same or greater word size
-                for(int j = 0; j < i; j++) {
-                    if(list.get(j).length() >= current.length()) {
+                for (int j = 0; j < i; j++) {
+                    if (list.get(j).length() >= current.length()) {
                         list.add(j, current);
                         // Remove duplicate current
-                        list.remove(i+1);
+                        list.remove(i + 1);
                         break;
                     }
                 }