Package name changed lowerclass

Author: anitsh

src/main/java/codechef/MinimumStepsToOneDynamicProgramming.java

@@ -49,7 +49,7 @@
  */
 public class MinimumStepsToOneDynamicProgramming {
 
-    public static void main(String args[]) {
+    public static void main(String[] args) {
         int positiveInt = 7;
         int expected = 3;
 

src/main/java/codility/PassingCars.java

@@ -24,7 +24,7 @@
 
 public class PassingCars {
 
-    public static void main(String args[]) {
+    public static void main(String[] args) {
 //        pairs7();
         pairs5();
     }

src/main/java/datastructures/BasicComparatorExample.java

@@ -266,9 +266,9 @@ public String toString(){
  * iterable.
  */
 class Employee implements Comparable<Employee> {
-    private int id;
-    private String name;
-    private String address;
+    private final int id;
+    private final String name;
+    private final String address;
 
     public Employee(int id, String name, String address) {
         this.id = id;
@@ -297,8 +297,8 @@ public int compareTo(Employee o) {
      */
     public static Comparator<Employee> COMPARE_BY_NAME = new Comparator<Employee>() {
         public int compare(Employee o1, Employee o2) {
-            Employee e1 = (Employee)o1;
-            Employee e2 = (Employee)o2;
+            Employee e1 = o1;
+            Employee e2 = o2;
 
             int nameCmp = e1.name.compareTo(e2.name);
             if ( nameCmp != 0 )

src/main/java/datastructures/BinarySearchMain.java

@@ -7,7 +7,7 @@
  */
 public class BinarySearchMain {
 
-    public static void main(String args[])
+    public static void main(String[] args)
     {
         mainIterative();
 
@@ -16,7 +16,7 @@ public static void main(String args[])
     static void mainRecursive()
     {
         BinarySearchRecursive ob = new BinarySearchRecursive();
-        int arr[] = { 2, 3, 4, 10, 40 };
+        int[] arr = { 2, 3, 4, 10, 40 };
         int n = arr.length;
         int x = 10;
         int result = ob.binarySearch(arr, 0, n - 1, x);
@@ -29,7 +29,7 @@ static void mainRecursive()
     static void mainIterative()
     {
         BinarySearchIterative ob = new BinarySearchIterative();
-        int arr[] = { 2, 3, 4, 10, 40 };
+        int[] arr = { 2, 3, 4, 10, 40 };
         int n = arr.length;
         int x = 10;
         int result = ob.binarySearch(arr, x);
@@ -53,7 +53,7 @@ static void mainIterative()
 class BinarySearchRecursive {
     // Returns index of x if it is present in arr[l..
     // r], else return -1
-    int binarySearch(int arr[], int l, int r, int x)
+    int binarySearch(int[] arr, int l, int r, int x)
     {
         if (r >= l) {
             int mid = l + (r - l) / 2;
@@ -89,7 +89,7 @@ int binarySearch(int arr[], int l, int r, int x)
 class BinarySearchIterative {
     // Returns index of x if it is present in arr[],
     // else return -1
-    int binarySearch(int arr[], int x)
+    int binarySearch(int[] arr, int x)
     {
         int l = 0, r = arr.length - 1;
         while (l <= r) {

src/main/java/datastructures/BinaryTree.java

@@ -101,7 +101,7 @@ public static int max(BinaryTreeNode root) {
         return max(root.right);
     }
 
-    public static void main(String args[]){
+    public static void main(String[] args){
 //        Scanner sc=new Scanner(System.in);
 //        int T=sc.nextInt();
         int[] nodes = {3, 5, 2, 1, 4, 6, 7};

src/main/java/datastructures/BinaryTreeHackerRank.java

@@ -69,14 +69,12 @@ public boolean contains(T value) {
             return true;
         }
         else if(value.compareTo(data) < 0) {
-            return (left == null)
-                    ? false // Not found; there are no more BinaryTreeHackerRanks in left subtree to check
-                    : left.contains(value); // Continue searching left subtree
+            // Not found; there are no more BinaryTreeHackerRanks in left subtree to check
+            return left != null && left.contains(value); // Continue searching left subtree
         }
         else { // data.compareTo(value) > 0
-            return (right == null)
-                    ? false // Not found; there are no more BinaryTreeHackerRanks in right subrtree to check
-                    : right.contains(value); // Continue searching right subtree
+            // Not found; there are no more BinaryTreeHackerRanks in right subrtree to check
+            return right != null && right.contains(value); // Continue searching right subtree
         }
     }
 

src/main/java/datastructures/BubbleSort.java

@@ -86,7 +86,7 @@ public static void main(String[] args) {
 //        bubbleSortV2(a);
 //        System.out.println(Arrays.toString(a));
 
-        List<Integer> arrayList = new ArrayList<Integer>();;
+        List<Integer> arrayList = new ArrayList<Integer>();
         arrayList.addAll(list);
         arrayList.get(0);
         arrayList.add(0, 12);

src/main/java/datastructures/DataStructuresInJava.java

@@ -117,7 +117,7 @@ public static void basicStack(){
         stacka.push(2);
         System.out.println(stacka.pop().toString()); // 2
         stacka.push(3);
-        System.out.println(stacka.toString()); // [1, 3]
+        System.out.println(stacka); // [1, 3]
     }
 
     public static void basicQueue() {
@@ -129,17 +129,17 @@ public static void basicQueue() {
         stack.push(1);
         stack.push(2);
         stack.push(3);
-        System.out.println(stack.toString()); // [1, 2, 3]
+        System.out.println(stack); // [1, 2, 3]
 
         while (!stack.isEmpty()) {
             queue.enqueue(stack.pop());
         }
-        System.out.println(queue.toString());
+        System.out.println(queue);
 
         while (!queue.isEmpty()) {
             stack.push(queue.dequeue());
         }
-        System.out.println(stack.toString()); // [3, 2, 1]
+        System.out.println(stack); // [3, 2, 1]
     }
 
     public static void basicsHashMaps() {
@@ -236,7 +236,7 @@ The time complexity of Priority Queue for insertion(enqueue) and deletion (deque
 //            System.out.println(iter.next() + " ");
 //        }
 
-        System.out.println(cities_queue.toString());
+        System.out.println(cities_queue);
     }
 
     public static void maxPriorityQueue() {
@@ -367,7 +367,7 @@ the deque interface is memory efficient
  */
 class ArrayQueue {
     private static int front, rear, capacity;
-    private static int queue[];
+    private static int[] queue;
 
     ArrayQueue(int size) {
         front = rear = 0;
@@ -379,7 +379,7 @@ class ArrayQueue {
     static void queueEnqueue(int item)  {
         // check if the queue is full
         if (capacity == rear) {
-            System.out.printf("\nQueue is full\n");
+            System.out.print("\nQueue is full\n");
             return;
         }
 
@@ -388,14 +388,13 @@ static void queueEnqueue(int item)  {
             queue[rear] = item;
             rear++;
         }
-        return;
     }
 
     //remove an element from the queue
     static void queueDequeue()  {
         // check if queue is empty
         if (front == rear) {
-            System.out.printf("\nQueue is empty\n");
+            System.out.print("\nQueue is empty\n");
             return;
         }
 
@@ -413,71 +412,68 @@ static void queueDequeue()  {
             // decrement rear
             rear--;
         }
-        return;
     }
 
     // print queue elements
     static void queueDisplay()
     {
         int i;
         if (front == rear) {
-            System.out.printf("Queue is Empty\n");
+            System.out.print("Queue is Empty\n");
             return;
         }
 
         // traverse front to rear and print elements
         for (i = front; i < rear; i++) {
             System.out.printf(" %d = ", queue[i]);
         }
-        return;
     }
 
     // print front of queue
     static void queueFront()
     {
         if (front == rear) {
-            System.out.printf("Queue is Empty\n");
+            System.out.print("Queue is Empty\n");
             return;
         }
         System.out.printf("\nFront Element of the queue: %d", queue[front]);
-        return;
     }
     public static void main(String[] args) {
         // Create a queue of capacity 4
         ArrayQueue q = new ArrayQueue(4);
 
         System.out.println("Initial Queue:");
         // print Queue elements
-        q.queueDisplay();
+        queueDisplay();
 
         // inserting elements in the queue
-        q.queueEnqueue(10);
-        q.queueEnqueue(30);
-        q.queueEnqueue(50);
-        q.queueEnqueue(70);
+        queueEnqueue(10);
+        queueEnqueue(30);
+        queueEnqueue(50);
+        queueEnqueue(70);
 
         // print Queue elements
         System.out.println("Queue after Enqueue Operation:");
-        q.queueDisplay();
+        queueDisplay();
 
         // print front of the queue
-        q.queueFront();
+        queueFront();
 
         // insert element in the queue
-        q.queueEnqueue(90);
+        queueEnqueue(90);
 
         // print Queue elements
-        q.queueDisplay();
+        queueDisplay();
 
-        q.queueDequeue();
-        q.queueDequeue();
-        System.out.printf("\nQueue after two dequeue operations:");
+        queueDequeue();
+        queueDequeue();
+        System.out.print("\nQueue after two dequeue operations:");
 
         // print Queue elements
-        q.queueDisplay();
+        queueDisplay();
 
         // print front of the queue
-        q.queueFront();
+        queueFront();
     }
 
 
@@ -545,7 +541,7 @@ public void print_frontRear() {
         System.out.println("Front of the queue:" + front.data
                 + " Rear of the queue:" + rear.data);
     }
-    public static void main(String a[]){
+    public static void main(String[] a){
 
         LinkedListQueue queue = new LinkedListQueue();
 

src/main/java/datastructures/DeleteDuplicateLinkedList.java

@@ -70,7 +70,7 @@ public static void display(Node head)
         }
     }
 
-    public static void main(String args[])
+    public static void main(String[] args)
     {
 //        Scanner sc=new Scanner(System.in);
         Node head=null;

src/main/java/datastructures/DoublyLinkedList.java

@@ -63,7 +63,7 @@ static class Node{
         int data;
         Node next;
         Node prev;
-    };
+    }
 
     static Node head=null;
 
@@ -109,7 +109,7 @@ static void printNodes()   {
         System.out.printf("%d ", temp.data);
 
         //traverse in backward direction starting from last node
-        System.out.printf("\nCircular doubly linked list travesed backward: \n");
+        System.out.print("\nCircular doubly linked list travesed backward: \n");
         Node last = head.prev;
         temp = last;
         while (temp.prev != last)
@@ -148,14 +148,14 @@ public static void cdllImpl()
         CircularDoublyLinkedList cdl_List = new CircularDoublyLinkedList();
 
         // add nodes to the list
-        cdl_List.addNode(40);
-        cdl_List.addNode(50);
-        cdl_List.addNode(60);
-        cdl_List.addNode(70);
-        cdl_List.addNode(80);
+        CircularDoublyLinkedList.addNode(40);
+        CircularDoublyLinkedList.addNode(50);
+        CircularDoublyLinkedList.addNode(60);
+        CircularDoublyLinkedList.addNode(70);
+        CircularDoublyLinkedList.addNode(80);
 
         //print the list
-        System.out.printf("Circular doubly linked list: ");
-        cdl_List.printNodes();
+        System.out.print("Circular doubly linked list: ");
+        CircularDoublyLinkedList.printNodes();
     }
 }