Added tags.

javadev · javadev · commit 0052acc8aa9d · 2022-03-22T15:08:36.000+02:00
diff --git a/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt
@@ -1,5 +1,8 @@
 package g0001_0100.s0001_two_sum
 
+// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
+// #Data_Structure_I_Day_2_Array #2022_03_22_Time_292_ms_(80.69%)_Space_41.6_MB_(60.71%)
+
 import java.util.Arrays
 
 class Solution {
diff --git a/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt b/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt
@@ -1,5 +1,9 @@
 package g0001_0100.s0002_add_two_numbers
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
+// #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
+// #2022_03_22_Time_212_ms_(93.71%)_Space_43.1_MB_(81.36%)
+
 import com_github_leetcode.ListNode
 
 /*
diff --git a/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt b/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt
@@ -1,29 +1,30 @@
 package g0001_0100.s0003_longest_substring_without_repeating_characters
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
+// #Algorithm_I_Day_6_Sliding_Window #2022_03_22_Time_212_ms_(91.24%)_Space_37_MB_(87.08%)
+
 class Solution {
     fun lengthOfLongestSubstring(s: String): Int {
-        val lastIndices = IntArray(256)
-        for (i in 0..255) {
-            lastIndices[i] = -1
+        var i = 0
+        var j = 0
+        var longest = 0
+        // 1. if string empty, return 0
+        if (s.isEmpty()) {
+            return 0
         }
-        var maxLen = 0
-        var curLen = 0
-        var start = 0
-        for (i in s.indices) {
-            val cur = s[i]
-            if (lastIndices[cur.code] < start) {
-                lastIndices[cur.code] = i
-                curLen++
+        while (j < s.length) {
+            // 2. if the char at index j already seen, update the longest if needs
+            if (i != j && s.substring(i, j).indexOf(s[j]) > -1) {
+                longest = Math.max(j - i, longest)
+                i++
             } else {
-                val lastIndex = lastIndices[cur.code]
-                start = lastIndex + 1
-                curLen = i - start + 1
-                lastIndices[cur.code] = i
-            }
-            if (curLen > maxLen) {
-                maxLen = curLen
+                // 3. j out of bound already, update longest
+                if (++j == s.length) {
+                    longest = Math.max(s.length - i, longest)
+                    break
+                }
             }
         }
-        return maxLen
+        return longest
     }
 }
diff --git a/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt b/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt
@@ -1,5 +1,8 @@
 package g0001_0100.s0004_median_of_two_sorted_arrays
 
+// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
+// #2022_03_22_Time_276_ms_(91.12%)_Space_47_MB_(85.71%)
+
 import kotlin.collections.ArrayList
 
 class Solution {
diff --git a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt
@@ -1,5 +1,9 @@
 package g0001_0100.s0005_longest_palindromic_substring
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
+// #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
+// #Dynamic_Programming_I_Day_17 #2022_03_22_Time_359_ms_(69.08%)_Space_38.5_MB_(61.84%)
+
 class Solution {
     fun longestPalindrome(s: String): String {
         val newStr = CharArray(s.length * 2 + 1)
diff --git a/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt b/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt
@@ -1,5 +1,7 @@
 package g0001_0100.s0006_zigzag_conversion
 
+// #Medium #String #2022_03_22_Time_351_ms_(78.99%)_Space_40_MB_(84.02%)
+
 class Solution {
     fun convert(s: String, numRows: Int): String {
         val sLen = s.length
diff --git a/src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt b/src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt
@@ -1,5 +1,7 @@
 package g0001_0100.s0007_reverse_integer
 
+// #Medium #Top_Interview_Questions #Math #2022_03_22_Time_230_ms_(57.36%)_Space_34.3_MB_(61.43%)
+
 class Solution {
     fun reverse(x: Int): Int {
         var rev: Long = 0
diff --git a/src/main/kotlin/g0001_0100/s0008_string_to_integer_atoi/Solution.kt b/src/main/kotlin/g0001_0100/s0008_string_to_integer_atoi/Solution.kt
@@ -1,5 +1,7 @@
 package g0001_0100.s0008_string_to_integer_atoi
 
+// #Medium #Top_Interview_Questions #String #2022_03_22_Time_152_ms_(99.64%)_Space_35.2_MB_(97.83%)
+
 class Solution {
     fun myAtoi(str: String?): Int {
         if (str == null || str.isEmpty()) {
diff --git a/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt b/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt
@@ -1,5 +1,7 @@
 package g0001_0100.s0009_palindrome_number
 
+// #Easy #Math #2022_03_22_Time_208_ms_(94.88%)_Space_35.9_MB_(90.14%)
+
 class Solution {
     fun isPalindrome(x: Int): Boolean {
         if (x < 0) return false
diff --git a/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt b/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
@@ -1,5 +1,7 @@
 package g0001_0100.s0010_regular_expression_matching
 
+// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
+
 class Solution {
     private lateinit var cache: Array<Array<Boolean?>>
 
diff --git a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt
@@ -1,5 +1,8 @@
 package g0001_0100.s0011_container_with_most_water
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
+// #2022_02_17_Time_3_ms_(91.89%)_Space_81.7_MB_(5.91%)
+
 class Solution {
     fun maxArea(height: IntArray): Int {
         var max = 0
diff --git a/src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt b/src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt
@@ -1,5 +1,7 @@
 package g0001_0100.s0012_integer_to_roman
 
+// #Medium #String #Hash_Table #Math #2022_02_17_Time_7_ms_(70.99%)_Space_44.8_MB_(31.56%)
+
 class Solution {
     fun intToRoman(num: Int): String? {
         var localNum = num
diff --git a/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt b/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt
@@ -1,5 +1,8 @@
 package g0001_0100.s0013_roman_to_integer
 
+// #Easy #Top_Interview_Questions #String #Hash_Table #Math
+// #2022_02_17_Time_5_ms_(82.08%)_Space_45_MB_(29.21%)
+
 class Solution {
     fun romanToInt(s: String): Int {
         var x = 0
diff --git a/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt b/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt
@@ -1,5 +1,8 @@
 package g0001_0100.s0015_3sum
 
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
+// #2022_02_17_Time_29_ms_(68.11%)_Space_59.7_MB_(23.79%)
+
 import java.util.Arrays
 import kotlin.collections.ArrayList
 
diff --git a/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt b/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt
@@ -1,10 +1,10 @@
 package g0001_0100.s0020_valid_parentheses
 
-import java.util.Stack
-
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
 // #2022_02_17_Time_3_ms_(53.65%)_Space_42.1_MB_(17.58%)
 
+import java.util.Stack
+
 class Solution {
     fun isValid(s: String): Boolean {
         val stack = Stack<Char>()
diff --git a/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt b/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt
@@ -1,10 +1,10 @@
 package g0001_0100.s0021_merge_two_sorted_lists
 
-import com_github_leetcode.ListNode
-
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
 // #2022_02_17_Time_1_ms_(61.88%)_Space_42.8_MB_(22.76%)
 
+import com_github_leetcode.ListNode
+
 class Solution {
     fun mergeTwoLists(l1: ListNode?, l2: ListNode?): ListNode? {
         var l1 = l1
diff --git a/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt b/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt
@@ -1,10 +1,10 @@
 package g0001_0100.s0023_merge_k_sorted_lists
 
-import com_github_leetcode.ListNode
-
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
 // #Divide_and_Conquer #Merge_Sort #2022_02_18_Time_1_ms_(100.00%)_Space_43.9_MB_(75.94%)
 
+import com_github_leetcode.ListNode
+
 class Solution {
     fun mergeKLists(lists: Array<ListNode>): ListNode? {
         return if (lists.size == 0) {
diff --git a/src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt b/src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt
@@ -1,9 +1,9 @@
 package g0001_0100.s0024_swap_nodes_in_pairs
 
-import com_github_leetcode.ListNode
-
 // #Medium #Linked_List #Recursion #2022_02_18_Time_0_ms_(100.00%)_Space_41.9_MB_(22.86%)
 
+import com_github_leetcode.ListNode
+
 class Solution {
     fun swapPairs(head: ListNode?): ListNode? {
         if (head == null) {
