Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #137 from daniel-mueller/coding-style-fixes

Browse Source 
turned some public methods private
This commit is contained in:
Chetan Kaushik 2017-10-18 22:52:22 +05:30 committed by GitHub
commit acc6f31bc7
3 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Dynamic Programming/Fibonacci.java
View File

@ -11,7 +11,7 @@ import java.util.Map;
public class Fibonacci {
public static Map<Integer,Integer> map = new HashMap<Integer,Integer>();
private static Map<Integer,Integer> map = new HashMap<Integer,Integer>();
public static void main(String[] args) throws Exception {
@ -29,7 +29,7 @@ public class Fibonacci {
* Outputs the nth fibonacci number
**/
public static int fibMemo(int n) {
private static int fibMemo(int n) {
if (map.containsKey(n)) {
return map.get(n);
}
@ -54,7 +54,7 @@ public class Fibonacci {
* Outputs the nth fibonacci number
**/
public static int fibBotUp(int n) {
private static int fibBotUp(int n) {
Map<Integer,Integer> fib = new HashMap<Integer,Integer>();

4
Dynamic Programming/Levenshtein_distance.java
View File

@ -7,7 +7,7 @@
*/
public class Levenshtein_distance{
private int minimum(int a, int b, int c){
private static int minimum(int a, int b, int c){
if(a < b && a < c){
return a;
}else if(b < a && b < c){
@ -16,7 +16,7 @@ public class Levenshtein_distance{
return c;
}
}
public int calculate_distance(String a, String b){
private static int calculate_distance(String a, String b){
len_a = a.length() + 1;
len_b = b.length() + 1;
int [][] distance_mat = new int[len_a][len_b];

2
Dynamic Programming/LongestIncreasingSubsequence.java
View File

@ -31,7 +31,7 @@ public class LongestIncreasingSubsequence {
return r;
}
public static int LIS(int[] array) {
private static int LIS(int[] array) {
int N = array.length;
if (N == 0)
return 0;