From 3f25ae85012d83bec726712c6f0fb2d22cea04f3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Daniel=20M=C3=BCller?= <danielmueller@limebird.de>
Date: Tue, 3 Oct 2017 18:26:07 +0200
Subject: [PATCH] turned some public methods private

---
 Dynamic Programming/Fibonacci.java                    | 6 +++---
 Dynamic Programming/Levenshtein_distance.java         | 4 ++--
 Dynamic Programming/LongestIncreasingSubsequence.java | 2 +-
 3 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Dynamic Programming/Fibonacci.java b/Dynamic Programming/Fibonacci.java
index 17c11d8d6ab6..b2524b4db471 100644
--- a/Dynamic Programming/Fibonacci.java	
+++ b/Dynamic Programming/Fibonacci.java	
@@ -11,7 +11,7 @@
 
 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 static void main(String[] args) throws Exception {
      * 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 static int fibMemo(int n) {
      * 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>();
 
diff --git a/Dynamic Programming/Levenshtein_distance.java b/Dynamic Programming/Levenshtein_distance.java
index 5bff389fbebf..49f399020af1 100644
--- a/Dynamic Programming/Levenshtein_distance.java	
+++ b/Dynamic Programming/Levenshtein_distance.java	
@@ -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 @@ private int minimum(int a, int b, int c){
 			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];
diff --git a/Dynamic Programming/LongestIncreasingSubsequence.java b/Dynamic Programming/LongestIncreasingSubsequence.java
index 1616c246e273..eaa574a40989 100644
--- a/Dynamic Programming/LongestIncreasingSubsequence.java	
+++ b/Dynamic Programming/LongestIncreasingSubsequence.java	
@@ -31,7 +31,7 @@ private static int upperBound(int[] ar, int l, int r, int key) {
         return r;
     }
 
-    public static int LIS(int[] array) {
+    private static int LIS(int[] array) {
         int N = array.length;
         if (N == 0)
             return 0;