Skip to content

Commit 26c2465

Browse files
authored
Moved StackPostfixNotation.java from the Others section to the Stack section (#4372)
* Moved StackPostfixNotation.java from the Others section to the Stack section * Put all stack related algo in a separate stack directory in the algorithms directory. The stack directory under data-structures now only contains various implementations of the stack data structure. * formatted files
1 parent a184484 commit 26c2465

13 files changed

+21
-23
lines changed

src/main/java/com/thealgorithms/datastructures/stacks/BalancedBrackets.java renamed to src/main/java/com/thealgorithms/stacks/BalancedBrackets.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Stack;
44

src/main/java/com/thealgorithms/datastructures/stacks/CalculateMaxOfMin.java renamed to src/main/java/com/thealgorithms/stacks/CalculateMaxOfMin.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
* Program description - Given an integer array. The task is to find the maximum of the minimum of
88
* the array
99
*/
10-
package com.thealgorithms.datastructures.stacks;
10+
package com.thealgorithms.stacks;
1111

1212
import java.util.*;
1313

src/main/java/com/thealgorithms/datastructures/stacks/DecimalToAnyUsingStack.java renamed to src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Stack;
44

src/main/java/com/thealgorithms/datastructures/stacks/DuplicateBrackets.java renamed to src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
// 1. You are given a string exp representing an expression.
44
// 2. Assume that the expression is balanced i.e. the opening and closing brackets match with each

src/main/java/com/thealgorithms/datastructures/stacks/InfixToPostfix.java renamed to src/main/java/com/thealgorithms/stacks/InfixToPostfix.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Stack;
44

src/main/java/com/thealgorithms/datastructures/stacks/LargestRectangle.java renamed to src/main/java/com/thealgorithms/stacks/LargestRectangle.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Stack;
44

src/main/java/com/thealgorithms/datastructures/stacks/MaximumMinimumWindow.java renamed to src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Arrays;
44
import java.util.Stack;

src/main/java/com/thealgorithms/datastructures/stacks/NextGraterElement.java renamed to src/main/java/com/thealgorithms/stacks/NextGraterElement.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Arrays;
44
import java.util.Stack;

src/main/java/com/thealgorithms/datastructures/stacks/NextSmallerElement.java renamed to src/main/java/com/thealgorithms/stacks/NextSmallerElement.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Arrays;
44
import java.util.Stack;

src/main/java/com/thealgorithms/datastructures/stacks/PostfixToInfix.java renamed to src/main/java/com/thealgorithms/stacks/PostfixToInfix.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.datastructures.stacks;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Stack;
44

src/main/java/com/thealgorithms/others/StackPostfixNotation.java renamed to src/main/java/com/thealgorithms/stacks/StackPostfixNotation.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package com.thealgorithms.others;
1+
package com.thealgorithms.stacks;
22

33
import java.util.Scanner;
44
import java.util.Stack;
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
1-
package com.thealgorithms.others;
1+
package com.thealgorithms.stacks;
22

33
import static org.junit.jupiter.api.Assertions.*;
44

5-
import com.thealgorithms.datastructures.stacks.CalculateMaxOfMin;
65
import org.junit.jupiter.api.Test;
76

87
public class CalculateMaxOfMinTest {
@@ -11,48 +10,48 @@ public class CalculateMaxOfMinTest {
1110
void testForOneElement() {
1211
int[] a = {10, 20, 30, 50, 10, 70, 30};
1312
int k = CalculateMaxOfMin.calculateMaxOfMin(a);
14-
assertTrue(k == 70);
13+
assertEquals(70, k);
1514
}
1615

1716
@Test
1817
void testForTwoElements() {
1918
int[] a = {5, 3, 2, 6, 3, 2, 6};
2019
int k = CalculateMaxOfMin.calculateMaxOfMin(a);
21-
assertTrue(k == 6);
20+
assertEquals(6, k);
2221
}
2322

2423
@Test
2524
void testForThreeElements() {
2625
int[] a = {10, 10, 10, 10, 10, 10, 10};
2726
int k = CalculateMaxOfMin.calculateMaxOfMin(a);
28-
assertTrue(k == 10);
27+
assertEquals(10, k);
2928
}
3029

3130
@Test
3231
void testForFourElements() {
3332
int[] a = {70, 60, 50, 40, 30, 20};
3433
int k = CalculateMaxOfMin.calculateMaxOfMin(a);
35-
assertTrue(k == 70);
34+
assertEquals(70, k);
3635
}
3736

3837
@Test
3938
void testForFiveElements() {
4039
int[] a = {50};
4140
int k = CalculateMaxOfMin.calculateMaxOfMin(a);
42-
assertTrue(k == 50);
41+
assertEquals(50, k);
4342
}
4443

4544
@Test
4645
void testForSixElements() {
4746
int[] a = {1, 4, 7, 9, 2, 4, 6};
4847
int k = CalculateMaxOfMin.calculateMaxOfMin(a);
49-
assertTrue(k == 9);
48+
assertEquals(9, k);
5049
}
5150

5251
@Test
5352
void testForSevenElements() {
5453
int[] a = {-1, -5, -7, -9, -12, -14};
5554
int k = CalculateMaxOfMin.calculateMaxOfMin(a);
56-
assertTrue(k == -1);
55+
assertEquals(-1, k);
5756
}
5857
}

src/test/java/com/thealgorithms/others/StackPostfixNotationTest.java renamed to src/test/java/com/thealgorithms/stacks/StackPostfixNotationTest.java

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
1-
package com.thealgorithms.others;
1+
package com.thealgorithms.stacks;
22

33
import static java.util.Map.entry;
4-
import static org.junit.jupiter.api.Assertions.assertEquals;
5-
import static org.junit.jupiter.api.Assertions.assertThrows;
4+
import static org.junit.jupiter.api.Assertions.*;
65

76
import java.util.Map;
87
import org.junit.jupiter.api.Test;

0 commit comments

Comments
 (0)