Merge pull request TheAlgorithms#399 from khalil2535/master

Update Stacks.java

Author: Christian Bender

Data Structures/Stacks/Stacks.java

@@ -43,6 +43,7 @@ public void push(int value){
 			stackArray[top] = value;
 		}else{
 			resize(maxSize*2);
+                        push(value);// don't forget push after resizing
 		}
 	}
 
@@ -58,6 +59,7 @@ public int pop(){
 
 		if(top < maxSize/4){
 			resize(maxSize/2);
+			return pop();// don't forget pop after resizing
 		}
 		else{
 			System.out.println("The stack is already empty");
@@ -80,9 +82,11 @@ public int peek(){
 	}
 
 	private void resize(int newSize){
-		private int[] transferArray = new int[newSize];
+		//private int[] transferArray = new int[newSize]; we can't put modifires here !
+                int[] transferArray = new int[newSize];
 
-		for(int i = 0; i < stackArray.length(); i++){
+		//for(int i = 0; i < stackArray.length(); i++){ the length isn't a method .
+                for(int i = 0; i < stackArray.length; i++){
 			transferArray[i] = stackArray[i];
 			stackArray = transferArray;
 		}