feat: change folder

rldnrl · Jul 21, 2023 · 5c3c479 · 5c3c479
1 parent 46ebfa1
commit 5c3c479
Show file tree

Hide file tree

Showing 41 changed files with 688 additions and 65 deletions.
diff --git a/.idea/sonarlint/issuestore/index.pb b/.idea/sonarlint/issuestore/index.pb
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/java-coding-interview.iml b/java-coding-interview.iml
@@ -4,8 +4,36 @@
     <exclude-output />
     <content url="file://$MODULE_DIR$">
       <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/test" isTestSource="true" />
     </content>
     <orderEntry type="inheritedJdk" />
     <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="module-library" scope="TEST">
+      <library name="JUnit4">
+        <CLASSES>
+          <root url="jar://$MAVEN_REPOSITORY$/junit/junit/4.13.1/junit-4.13.1.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/hamcrest/hamcrest-core/1.3/hamcrest-core-1.3.jar!/" />
+        </CLASSES>
+        <JAVADOC />
+        <SOURCES />
+      </library>
+    </orderEntry>
+    <orderEntry type="module-library" scope="TEST">
+      <library name="JUnit5.8.1">
+        <CLASSES>
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter/5.8.1/junit-jupiter-5.8.1.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter-api/5.8.1/junit-jupiter-api-5.8.1.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/opentest4j/opentest4j/1.2.0/opentest4j-1.2.0.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/platform/junit-platform-commons/1.8.1/junit-platform-commons-1.8.1.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/apiguardian/apiguardian-api/1.1.2/apiguardian-api-1.1.2.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter-params/5.8.1/junit-jupiter-params-5.8.1.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/jupiter/junit-jupiter-engine/5.8.1/junit-jupiter-engine-5.8.1.jar!/" />
+          <root url="jar://$MAVEN_REPOSITORY$/org/junit/platform/junit-platform-engine/1.8.1/junit-platform-engine-1.8.1.jar!/" />
+        </CLASSES>
+        <JAVADOC />
+        <SOURCES />
+      </library>
+    </orderEntry>
+    <orderEntry type="library" name="KotlinJavaRuntime" level="project" />
   </component>
 </module>
diff --git a/src/datastructure/TheMap.java b/src/datastructure/TheMap.java
@@ -16,7 +16,7 @@ public static void main(String[] args) {
         System.out.println(map.size()); // 3
         System.out.println(map.get(1)); // Alex
         System.out.println(map.containsKey(4)); // false
-        System.out.println(map.keySet());
+        System.out.println(map.keySet()); // [1=Person[name=Alex], 2=Person[name=Siri], 3=Person[name=Mariam]]
         System.out.println(map.entrySet());
         System.out.println(map.values());
         map.remove(3);

diff --git a/src/leetcode/BestTimeToBuyAndSellStock.java → ...tcode/java/BestTimeToBuyAndSellStock.java b/src/leetcode/BestTimeToBuyAndSellStock.java → ...tcode/java/BestTimeToBuyAndSellStock.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 public class BestTimeToBuyAndSellStock {
     /**

diff --git a/src/leetcode/CarFleet.java → src/leetcode/java/CarFleet.java b/src/leetcode/CarFleet.java → src/leetcode/java/CarFleet.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/ContainerWithMostWater.java → ...leetcode/java/ContainerWithMostWater.java b/src/leetcode/ContainerWithMostWater.java → ...leetcode/java/ContainerWithMostWater.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 public class ContainerWithMostWater {
     /**

diff --git a/src/leetcode/ContainsDuplicate.java → src/leetcode/java/ContainsDuplicate.java b/src/leetcode/ContainsDuplicate.java → src/leetcode/java/ContainsDuplicate.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.HashMap;
 import java.util.HashSet;

diff --git a/src/leetcode/EncodeAndDecodeStrings.java → ...leetcode/java/EncodeAndDecodeStrings.java b/src/leetcode/EncodeAndDecodeStrings.java → ...leetcode/java/EncodeAndDecodeStrings.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/...code/FindMinimumInRotatedSortedArray.java → ...java/FindMinimumInRotatedSortedArray.java b/...code/FindMinimumInRotatedSortedArray.java → ...java/FindMinimumInRotatedSortedArray.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 public class FindMinimumInRotatedSortedArray {
     /**

diff --git a/src/leetcode/FirstUniqueCharacter.java → src/leetcode/java/FirstUniqueCharacter.java b/src/leetcode/FirstUniqueCharacter.java → src/leetcode/java/FirstUniqueCharacter.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.HashMap;
 import java.util.Map;

diff --git a/src/leetcode/GroupAnagrams.java → src/leetcode/java/GroupAnagrams.java b/src/leetcode/GroupAnagrams.java → src/leetcode/java/GroupAnagrams.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/IsIsomorphic.java → src/leetcode/java/IsIsomorphic.java b/src/leetcode/IsIsomorphic.java → src/leetcode/java/IsIsomorphic.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/LongPalindromicSubString.java → ...etcode/java/LongPalindromicSubString.java b/src/leetcode/LongPalindromicSubString.java → ...etcode/java/LongPalindromicSubString.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 public class LongPalindromicSubString {
     public static String longestPalindrome(String s) {

diff --git a/src/leetcode/LongestConsecutive.java → src/leetcode/java/LongestConsecutive.java b/src/leetcode/LongestConsecutive.java → src/leetcode/java/LongestConsecutive.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/...tSubstringWithoutRepeatingCharacters.java → ...tSubstringWithoutRepeatingCharacters.java b/...tSubstringWithoutRepeatingCharacters.java → ...tSubstringWithoutRepeatingCharacters.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/MaximumSubarray.java → src/leetcode/java/MaximumSubarray.java b/src/leetcode/MaximumSubarray.java → src/leetcode/java/MaximumSubarray.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 /**
  * <a href="https://leetcode.com/problems/maximum-subarray/">Maximum Subarray</a>

diff --git a/src/leetcode/MergeSortArray.java → src/leetcode/java/MergeSortArray.java b/src/leetcode/MergeSortArray.java → src/leetcode/java/MergeSortArray.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.Arrays;
 

diff --git a/src/leetcode/MinimumWindowSubstring.java → ...leetcode/java/MinimumWindowSubstring.java b/src/leetcode/MinimumWindowSubstring.java → ...leetcode/java/MinimumWindowSubstring.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/java/OnlineStockSpan.java b/src/leetcode/java/OnlineStockSpan.java
@@ -0,0 +1,65 @@
+package leetcode.java;
+
+import java.util.*;
+
+/**
+ * [7,2,1,2]
+ * today: 2
+ * span 4
+ *
+ * ["StockSpanner", "next", "next", "next", "next", "next", "next", "next"]
+ * [[], [100], [80], [60], [70], [60], [75], [85]]
+ *
+ * [null, 1, 1, 1, 2, 1, 4, 6]
+ *
+ * StockSpanner stockSpanner = new StockSpanner();
+ * stockSpanner.next(100); // return 1
+ * stockSpanner.next(80);  // return 1
+ * stockSpanner.next(60);  // return 1
+ * stockSpanner.next(70);  // return 2
+ * stockSpanner.next(60);  // return 1
+ * stockSpanner.next(75);  // return 4, because the last 4 prices (including today's price of 75) were less than or equal to today's price.
+ * stockSpanner.next(85);  // return 6
+ *
+ * stack = [100]
+ * stack = [100, 80]
+ * stack = [100, 80, 60]
+ * stack = [100, 80, 60, 70]
+ * stack = [100, 80, 60, 70, 60]
+ * stack = [100, 80, 60, 70, 60, 75]
+ * stack = [100, 80, 60, 70, 60, 75]
+ *
+ * stack = [75, 60, 70, 60, 80, 100]
+ */
+public class OnlineStockSpan {
+    Stack<Integer> stack;
+    public OnlineStockSpan() {
+        this.stack = new Stack<>();
+    }
+
+    public int next(int price) {
+        this.stack.push(price);
+        List<Integer> list = new ArrayList<>();
+
+        for (Integer element: this.stack) {
+            list.add(element);
+        }
+
+        Collections.reverse(list);
+
+        if (list.size() == 1) {
+            return 1;
+        }
+
+        int result = 1;
+        for (Integer element: list) {
+            if (element <= price) {
+                result++;
+            } else {
+                break;
+            }
+        }
+
+        return result;
+    }
+}
diff --git a/src/leetcode/ProductOfArrayExceptSelf.java → ...etcode/java/ProductOfArrayExceptSelf.java b/src/leetcode/ProductOfArrayExceptSelf.java → ...etcode/java/ProductOfArrayExceptSelf.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.Arrays;
 

diff --git a/src/leetcode/ReverseString.java → src/leetcode/java/ReverseString.java b/src/leetcode/ReverseString.java → src/leetcode/java/ReverseString.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.Stack;
 

diff --git a/src/leetcode/RotateRightArray.java → src/leetcode/java/RotateRightArray.java b/src/leetcode/RotateRightArray.java → src/leetcode/java/RotateRightArray.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.Arrays;
 

diff --git a/src/leetcode/StringCompression.java → src/leetcode/java/StringCompression.java b/src/leetcode/StringCompression.java → src/leetcode/java/StringCompression.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 public class StringCompression {
     public static int compress(char[] chars) {

diff --git a/src/leetcode/ThreeSum.java → src/leetcode/java/ThreeSum.java b/src/leetcode/ThreeSum.java → src/leetcode/java/ThreeSum.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/TopKFrequencyElements.java → src/leetcode/java/TopKFrequencyElements.java b/src/leetcode/TopKFrequencyElements.java → src/leetcode/java/TopKFrequencyElements.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/TopKFrequentWords.java → src/leetcode/java/TopKFrequentWords.java b/src/leetcode/TopKFrequentWords.java → src/leetcode/java/TopKFrequentWords.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.*;
 

diff --git a/src/leetcode/TwoSum.java → src/leetcode/java/TwoSum.java b/src/leetcode/TwoSum.java → src/leetcode/java/TwoSum.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.HashMap;
 

diff --git a/src/leetcode/ValidAnagram.java → src/leetcode/java/ValidAnagram.java b/src/leetcode/ValidAnagram.java → src/leetcode/java/ValidAnagram.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.Arrays;
 import java.util.HashMap;

diff --git a/src/leetcode/ValidPalindrome.java → src/leetcode/java/ValidPalindrome.java b/src/leetcode/ValidPalindrome.java → src/leetcode/java/ValidPalindrome.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 public class ValidPalindrome {
     public static String removeNonCharacter(String s) {

diff --git a/src/leetcode/ValidParentheses.java → src/leetcode/java/ValidParentheses.java b/src/leetcode/ValidParentheses.java → src/leetcode/java/ValidParentheses.java
@@ -1,4 +1,4 @@
-package leetcode;
+package leetcode.java;
 
 import java.util.HashMap;
 import java.util.Objects;

diff --git a/src/leetcode/GroupAnagrams.kt → src/leetcode/kotlin/GroupAnagrams.kt b/src/leetcode/GroupAnagrams.kt → src/leetcode/kotlin/GroupAnagrams.kt
@@ -1,4 +1,4 @@
-package leetcode
+package leetcode.kotlin
 
 class GroupAnagrams {
     fun solutionWithSorting(strs: Array<String>): List<List<String>> {

diff --git a/test/leetcode/ContainsDuplicateTest.java b/test/leetcode/ContainsDuplicateTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.ContainsDuplicate;
 import org.junit.jupiter.api.Test;
 import org.junit.jupiter.api.Assertions;
 

diff --git a/test/leetcode/FirstUniqueCharacterTest.java b/test/leetcode/FirstUniqueCharacterTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.FirstUniqueCharacter;
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 

diff --git a/test/leetcode/LongPalindromicSubStringTest.java b/test/leetcode/LongPalindromicSubStringTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.LongPalindromicSubString;
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 

diff --git a/test/leetcode/MaximumSubarrayTest.java b/test/leetcode/MaximumSubarrayTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.MaximumSubarray;
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 

diff --git a/test/leetcode/RotateRightArrayTest.java b/test/leetcode/RotateRightArrayTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.RotateRightArray;
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 

diff --git a/test/leetcode/TwoSumTest.java b/test/leetcode/TwoSumTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.TwoSum;
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 

diff --git a/test/leetcode/ValidAnagramTest.java b/test/leetcode/ValidAnagramTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.ValidAnagram;
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;
 

diff --git a/test/leetcode/ValidPalindromeTest.java b/test/leetcode/ValidPalindromeTest.java
@@ -3,7 +3,7 @@
 import org.junit.Test;
 import org.junit.jupiter.api.Assertions;
 
-import static leetcode.ValidPalindrome.*;
+import static leetcode.java.ValidPalindrome.*;
 
 public class ValidPalindromeTest {
     @Test

diff --git a/test/leetcode/ValidParenthesesTest.java b/test/leetcode/ValidParenthesesTest.java
@@ -1,5 +1,6 @@
 package leetcode;
 
+import leetcode.java.ValidParentheses;
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;