Skip to content

Commit 2a1fc02

Browse files
KennethNeroKennethNero
committed
Many quality of code changes
Removing unused imports, cleaning up (at a base level) code, and removing some package declarations. By no means did I get all of them.
1 parent a0fd638 commit 2a1fc02

18 files changed

+954
-24
lines changed

‎.idea/misc.xml

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/modules.xml

Lines changed: 8 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/vcs.xml

Lines changed: 6 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎.idea/workspace.xml

Lines changed: 908 additions & 0 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎Dynamic Programming/Levenshtein_distance.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -17,8 +17,8 @@ private static int minimum(int a, int b, int c){
1717
}
1818
}
1919
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;
2222
int [][] distance_mat = new int[len_a][len_b];
2323
for(int i = 0; i < len_a; i++){
2424
distance_mat[i][0] = i;

‎Dynamic Programming/rod_cutting.java

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,7 @@
22
Returns the best obtainable price for a rod of
33
length n and price[] as prices of different pieces */
44

5-
public class RodCutting
6-
{
5+
public class RodCutting {
76

87
private static int cutRod(int price[],int n)
98
{

‎Java.iml

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
<?xml version="1.0" encoding="UTF-8"?>
2+
<module type="JAVA_MODULE" version="4">
3+
<component name="NewModuleRootManager">
4+
<output url="file://$MODULE_DIR$/bin" />
5+
<exclude-output />
6+
<content url="file://$MODULE_DIR$">
7+
<sourceFolder url="file://$MODULE_DIR$" isTestSource="false" />
8+
<sourceFolder url="file://$MODULE_DIR$/data_structures" isTestSource="false" />
9+
</content>
10+
<orderEntry type="sourceFolder" forTests="false" />
11+
<orderEntry type="inheritedJdk" />
12+
</component>
13+
</module>

‎Others/Abecedarian.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,6 +12,6 @@ public static boolean isAbecedarian(String s){
1212

1313
else{return false;}
1414
}
15-
}
1615
return true;
16+
}
1717
}

‎Others/Dijkshtra.java

Lines changed: 6 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,11 @@
44
*/
55

66

7+
import java.io.IOException;
8+
import java.util.Arrays;
9+
import java.util.Scanner;
10+
import java.util.Stack;
11+
712
public class Solution {
813

914
public static void main(String[] args) throws IOException {
@@ -30,7 +35,7 @@ public static void main(String[] args) throws IOException {
3035

3136
//Implementing Dijkshtra's Algorithm
3237

33-
Stack <Integer> t=new Stack<Integer>();
38+
Stack<Integer> t=new Stack<Integer>();
3439
int src=in.nextInt();
3540
for(int i=1;i<=n;i++){
3641
if(i!=src){t.push(i);}}

‎Others/Factorial.java

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
package factorial;
21
import java.util.Scanner;
32

43
/**

‎Others/FloydTriangle.java

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
import java.util.Scanner;
22

3-
43
public class FloydTriangle {
54
public static void main(String[] args) {
65
Scanner sc = new Scanner(System.in);

‎Others/ReverseStackUsingRecursion.java

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -67,8 +67,4 @@ private static void insertAtEnd(int temptop) {
6767

6868
}
6969

70-
71-
72-
73-
7470
}

‎Others/ReverseString.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@ public static void main(String args[]) throws IOException
3939
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
4040
System.out.println("Enter the string");
4141
String srr=br.readLine();
42-
System.out.println("Reverse="+reverseString(srr));
42+
System.out.println("Reverse="+reverse(srr));
4343
br.close();
4444
}
4545
}

‎Others/krishnamurthy.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,5 @@
11
import java.util.Scanner;
2+
23
class krishnamurthy
34
{
45
int fact(int n)

‎Others/root_precision.java

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,4 @@
1-
import java.io.*;
21
import java.util.*;
3-
import java.text.*;
4-
import java.math.*;
5-
import java.util.regex.*;
62

73
public class Solution {
84

‎Sorts/radixSort.java

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,3 @@
1-
2-
import java.io.*;
31
import java.util.*;
42

53
class Radix {

‎data_structures/Graphs/PrimMST.java

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,7 @@
11
// A Java program for Prim's Minimum Spanning Tree (MST) algorithm.
22
//adjacency matrix representation of the graph
3-
4-
import java.util.*;
3+
54
import java.lang.*;
6-
import java.io.*;
75

86
class PrimMST
97
{

‎data_structures/HashMap/HashMap.java

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,3 @@
1-
2-
31
import java.util.ArrayList;
42
import java.util.LinkedList;
53

0 commit comments

Comments
 (0)