diff --git a/.idea/misc.xml b/.idea/misc.xml index 5217e29a..e0844bc7 100644 --- a/.idea/misc.xml +++ b/.idea/misc.xml @@ -1,6 +1,6 @@ - + \ No newline at end of file diff --git a/.idea/workspace.xml b/.idea/workspace.xml index cec811f8..05f37c6b 100644 --- a/.idea/workspace.xml +++ b/.idea/workspace.xml @@ -1,8 +1,18 @@ + + - - + + - - + + + - - - - + + + + + + + @@ -87,6 +104,19 @@ + + + + + + + + - + + @@ -125,4 +156,15 @@ + + + \ No newline at end of file diff --git a/out/production/junit-studio-lc101/main/BalancedBrackets.class b/out/production/junit-studio-lc101/main/BalancedBrackets.class deleted file mode 100644 index 34cbf6fc..00000000 Binary files a/out/production/junit-studio-lc101/main/BalancedBrackets.class and /dev/null differ diff --git a/out/production/junit-studio-lc101/test/BalancedBracketsTest.class b/out/production/junit-studio-lc101/test/BalancedBracketsTest.class deleted file mode 100644 index c1b63861..00000000 Binary files a/out/production/junit-studio-lc101/test/BalancedBracketsTest.class and /dev/null differ diff --git a/src/main/BonusBinarySearch.java b/src/main/BonusBinarySearch.java index b9f6976f..82f645f1 100644 --- a/src/main/BonusBinarySearch.java +++ b/src/main/BonusBinarySearch.java @@ -28,3 +28,4 @@ public static int binarySearch(int[] sortedNumbers, int n) { } } + diff --git a/src/test/BalancedBracketsTest.java b/src/test/BalancedBracketsTest.java index 3677ab96..ea571ed8 100644 --- a/src/test/BalancedBracketsTest.java +++ b/src/test/BalancedBracketsTest.java @@ -1,16 +1,56 @@ package test; - +import main.BalancedBrackets; import org.junit.Test; import static org.junit.Assert.*; public class BalancedBracketsTest { - - //TODO: add tests here + @Test + public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsFalse2() { + assertTrue(BalancedBrackets.hasBalancedBrackets("[ ][[[[[[[[[[]a[bcdef[ghij]klm[]no]p]]]]")); + } + @Test + public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsFalse1() { + assertTrue(BalancedBrackets.hasBalancedBrackets("[[]a[bcdef[ghij]klm[]no]p]]]]")); + } + @Test + public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsTrue2() { + assertTrue(BalancedBrackets.hasBalancedBrackets("[[[][[]a[bcdef[ghij]klm[]no]p]]]")); + } + @Test + public void MultiplePairsBracketsWithSomeCharactersInsideAndAroundReturnsTrue1() { + assertTrue(BalancedBrackets.hasBalancedBrackets("[[]a[bcdef[ghij]klm[]no]p]")); + } + @Test + public void onlyOnePairBracketsWithSomeCharactersInsideAndAroundReturnsTrue() { + assertTrue(BalancedBrackets.hasBalancedBrackets("abcdef[ghij]klmnop")); + } + @Test + public void onlyOnePairBracketsWithSomeCharactersAroundReturnsTrue() { + assertTrue(BalancedBrackets.hasBalancedBrackets("abcdefghij[]klmnop")); + } + @Test + public void onlyOnePairBracketsWithSomeCharactersOutsideReturnsTrue() { + assertTrue(BalancedBrackets.hasBalancedBrackets("abcdefghijklmnop[]")); + } + @Test + public void onlyOnePairBracketsWithSomeCharactersInsideReturnsTrue() { + assertTrue(BalancedBrackets.hasBalancedBrackets("[abcdefghijklmnop]")); + } + @Test + public void onlyOneClosedBracketsReturnsFalse() { + assertFalse(BalancedBrackets.hasBalancedBrackets("]")); + } + @Test + public void onlyOneOpenBracketsReturnsFalse() { + assertFalse(BalancedBrackets.hasBalancedBrackets("[")); + } + @Test + public void onlyBracketsReturnsTrue() { + assertTrue(BalancedBrackets.hasBalancedBrackets("[]")); + } @Test public void emptyTest() { assertEquals(true, true); } - - } diff --git a/src/test/BonusBinarySearchTest.java b/src/test/BonusBinarySearchTest.java new file mode 100644 index 00000000..68a02588 --- /dev/null +++ b/src/test/BonusBinarySearchTest.java @@ -0,0 +1,71 @@ +package test; + +import org.junit.Test; + +import static main.BonusBinarySearch.binarySearch; +import static org.junit.Assert.assertEquals; +import static org.junit.Assert.assertFalse; + +public class BonusBinarySearchTest { + + @Test + public void invalidTestTrue4() { + assertEquals(-1, binarySearch(new int[]{}, 10)); + } + + @Test + public void invalidTestTrue3() { + assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000} , 10000000)); + } + + @Test + public void invalidTestTrue2() { + assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000}, 10)); + } + + @Test + public void invalidTestTrue1() { + assertEquals(-1, binarySearch(new int[] {1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000}, 10)); + } + + @Test + public void invalidTestFalse3() { + assertEquals(-1, binarySearch(new int[] {1,2,3,119835,198354,19835,1,1,1,1,100, 100, 1000}, 10)); + } + + @Test + public void invalidTestFalse2() { + assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,100}, 10)); + } + + @Test + public void invalidTestFalse1() { + assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1}, 19839)); + } + + @Test + public void validTest4() { + assertEquals(-1, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1,-1}, -1)); + } + + @Test + public void validTest3() { + assertEquals(19835, binarySearch(new int[]{1,2,3,119835,198354,19835,1,1,1,1}, 19835)); + } + + @Test + public void validTest2() { + assertEquals(10, binarySearch(new int[]{10,1,2,3,1,1,1,1,1}, 10)); + } + + @Test + public void validTest1() { + assertEquals(10, binarySearch(new int[]{1,2,3,10}, 10)); + } + + @Test + public void emptyTest() { + assertEquals(10, 10, .001); + assertEquals(true, true); + } +}