Many quality of code changes

KennethNero · KennethNero · commit 2a1fc0264840 · 2017-10-26T19:56:18.000-04:00
Removing unused imports, cleaning up (at a base level) code, and removing some package declarations. By no means did I get all of them.
diff --git a/.idea/misc.xml b/.idea/misc.xml
diff --git a/.idea/modules.xml b/.idea/modules.xml
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/Dynamic Programming/Levenshtein_distance.java b/Dynamic Programming/Levenshtein_distance.java
@@ -17,8 +17,8 @@ private static int minimum(int a, int b, int c){
 		}
 	}
 	private static int calculate_distance(String a, String b){
-		len_a = a.length() + 1;
-		len_b = b.length() + 1;
+		int len_a = a.length() + 1;
+		int len_b = b.length() + 1;
 		int [][] distance_mat = new int[len_a][len_b];
 		for(int i = 0; i < len_a; i++){
 			distance_mat[i][0] = i;
diff --git a/Dynamic Programming/rod_cutting.java b/Dynamic Programming/rod_cutting.java
@@ -2,8 +2,7 @@
     Returns the best obtainable price for a rod of
 	length n and price[] as prices of different pieces */
 
-public class RodCutting
-{
+public class RodCutting {
 	
 	private static int cutRod(int price[],int n)
 	{
diff --git a/Java.iml b/Java.iml
@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <output url="file://$MODULE_DIR$/bin" />
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/data_structures" isTestSource="false" />
+    </content>
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="inheritedJdk" />
+  </component>
+</module>
diff --git a/Others/Abecedarian.java b/Others/Abecedarian.java
@@ -12,6 +12,6 @@ public static boolean isAbecedarian(String s){
 
             else{return false;}
             }
-        }
         return true;
+        }
 }
diff --git a/Others/Dijkshtra.java b/Others/Dijkshtra.java
@@ -4,6 +4,11 @@
 */
 
 
+import java.io.IOException;
+import java.util.Arrays;
+import java.util.Scanner;
+import java.util.Stack;
+
 public class Solution {
 
 public static void main(String[] args) throws IOException {
@@ -30,7 +35,7 @@ public static void main(String[] args) throws IOException {
 	
 	//Implementing Dijkshtra's Algorithm 
 	
-         Stack <Integer> t=new Stack<Integer>();
+         Stack<Integer> t=new Stack<Integer>();
           int src=in.nextInt();
         for(int i=1;i<=n;i++){
         	if(i!=src){t.push(i);}}
diff --git a/Others/Factorial.java b/Others/Factorial.java
@@ -1,4 +1,3 @@
-package factorial;
 import java.util.Scanner;
 
 /**
diff --git a/Others/FloydTriangle.java b/Others/FloydTriangle.java
@@ -1,6 +1,5 @@
 import java.util.Scanner;
 
-
 public class FloydTriangle {
     public static void main(String[] args) {
           Scanner sc = new Scanner(System.in);
diff --git a/Others/ReverseStackUsingRecursion.java b/Others/ReverseStackUsingRecursion.java
@@ -67,8 +67,4 @@ private static void insertAtEnd(int temptop) {
 
     }
 
-
-
-
-
 }
diff --git a/Others/ReverseString.java b/Others/ReverseString.java
@@ -39,7 +39,7 @@ public static void main(String args[]) throws IOException
 		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
 		System.out.println("Enter the string");
 		String srr=br.readLine();
-		System.out.println("Reverse="+reverseString(srr));
+		System.out.println("Reverse="+reverse(srr));
 		br.close();
 	}
 }
diff --git a/Others/krishnamurthy.java b/Others/krishnamurthy.java
@@ -1,4 +1,5 @@
 import java.util.Scanner;
+
 class krishnamurthy
 {
  int fact(int n)
diff --git a/Others/root_precision.java b/Others/root_precision.java
@@ -1,8 +1,4 @@
-import java.io.*;
 import java.util.*;
-import java.text.*;
-import java.math.*;
-import java.util.regex.*;
 
 public class Solution {
 
diff --git a/Sorts/radixSort.java b/Sorts/radixSort.java
@@ -1,5 +1,3 @@
-
-import java.io.*;
 import java.util.*;
  
 class Radix {
diff --git a/data_structures/Graphs/PrimMST.java b/data_structures/Graphs/PrimMST.java
@@ -1,9 +1,7 @@
 // A Java program for Prim's Minimum Spanning Tree (MST) algorithm.
 //adjacency matrix representation of the graph
- 
-import java.util.*;
+
 import java.lang.*;
-import java.io.*;
  
 class PrimMST
 {
diff --git a/data_structures/HashMap/HashMap.java b/data_structures/HashMap/HashMap.java
@@ -1,5 +1,3 @@
-
-
 import java.util.ArrayList;
 import java.util.LinkedList;
 

Original file line number	Diff line number	Diff line change
`@@ -17,8 +17,8 @@ private static int minimum(int a, int b, int c){`
`17`	`17`	`}`
`18`	`18`	`}`
`19`	`19`	`private static int calculate_distance(String a, String b){`
`20`		`- len_a = a.length() + 1;`
`21`		`- len_b = b.length() + 1;`
	`20`	`+ int len_a = a.length() + 1;`
	`21`	`+ int len_b = b.length() + 1;`
`22`	`22`	`int [][] distance_mat = new int[len_a][len_b];`
`23`	`23`	`for(int i = 0; i < len_a; i++){`
`24`	`24`	`distance_mat[i][0] = i;`
Original file line number	Diff line number	Diff line change
`@@ -2,8 +2,7 @@`
`2`	`2`	`Returns the best obtainable price for a rod of`
`3`	`3`	`length n and price[] as prices of different pieces */`
`4`	`4`
`5`		`-public class RodCutting`
`6`		`-{`
	`5`	`+public class RodCutting {`
`7`	`6`
`8`	`7`	`private static int cutRod(int price[],int n)`
`9`	`8`	`{`
Original file line number	Diff line number	Diff line change
`@@ -12,6 +12,6 @@ public static boolean isAbecedarian(String s){`
`12`	`12`
`13`	`13`	`else{return false;}`
`14`	`14`	`}`
`15`		`- }`
`16`	`15`	`return true;`
	`16`	`+ }`
`17`	`17`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,3 @@`
`1`		`-package factorial;`
`2`	`1`	`import java.util.Scanner;`
`3`	`2`
`4`	`3`	`/**`