feat: add the solution of Longest Substring Without Repeating Characters(003) with kotlin.

Author: relish-wang

README.md

@@ -27,7 +27,7 @@
 | :-----------------: | ------------------------------------------------------------ | :---------: | :------------: |:-----------: | :-------------: |
 | [001][001-question] | [Two Sum][001-tips]                                          | [Easy][E]   | [✅][001-java] | [✅][001-js] | [✅][001-kotlin] |
 | [002][002-question] | [Add Two Numbers][002-tips]                                  | [Medium][M] | [✅][002-java] |              | [✅][002-kotlin] |
-| [003][003-question] | [Longest Substring Without Repeating Characters][003-tips]   | [Medium][M] | [✅][003-java] |              |                  |
+| [003][003-question] | [Longest Substring Without Repeating Characters][003-tips]   | [Medium][M] | [✅][003-java] |              | [✅][003-kotlin] |
 | [004][004-question] | [Median of Two Sorted Arrays][004-tips]                      | [Hard][H]   | [✅][004-java] |              |                  |
 | [005][005-question] | [Longest Palindromic Substring][005-tips]                    | [Medium][M] | [✅][005-java] |              |                  |
 | [006][006-question] | [ZigZag Conversion][006-tips]                                | [Medium][M] | [✅][006-java] |              |                  |
@@ -489,6 +489,7 @@
 
 [001-kotlin]: ./src/_001/kotlin/Solution.kt
 [002-kotlin]: ./src/_002/kotlin/Solution.kt
+[003-kotlin]: ./src/_003/kotlin/Solution.kt
 [007-kotlin]: ./src/_007/kotlin/Solution.kt
 [009-kotlin]: ./src/_009/kotlin/Solution.kt
 [013-kotlin]: ./src/_013/kotlin/Solution.kt

src/_003/kotlin/Solution.kt

@@ -0,0 +1,72 @@
+package _003.kotlin
+
+import java.util.HashSet
+import java.util.HashMap
+
+
+
+
+
+/**
+ * @author relish
+ * @since 2018/10/20
+ */
+class Solution {
+    fun lengthOfLongestSubstring1(s: String): Int {
+        val n = s.length
+        val set = HashSet<Char>()
+        var ans = 0
+        var i = 0
+        var j = 0
+        while (i < n && j < n) {
+            // try to extend the range [i, j]
+            if (!set.contains(s[j])) {
+                set.add(s[j++])
+                ans = Math.max(ans, j - i)
+            } else {
+                set.remove(s[i++])
+            }
+        }
+        return ans
+    }
+
+
+    fun lengthOfLongestSubstring2(s: String): Int {
+        val n = s.length
+        var ans = 0
+        val map = HashMap<Char, Int>() // current index of character
+        // try to extend the range [i, j]
+        var j = 0
+        var i = 0
+        while (j < n) {
+            if (map.containsKey(s[j])) {
+                i = Math.max(map.get(s[j])!!, i)
+            }
+            ans = Math.max(ans, j - i + 1)
+            map[s[j]] = j + 1
+            j++
+        }
+        return ans
+    }
+
+    fun lengthOfLongestSubstring3(s: String): Int {
+        val n = s.length
+        var ans = 0
+        val index = IntArray(128) // current index of character
+        // try to extend the range [i, j]
+        var j = 0
+        var i = 0
+        while (j < n) {
+            i = Math.max(index[s[j].toInt()], i)
+            ans = Math.max(ans, j - i + 1)
+            index[s[j].toInt()] = j + 1
+            j++
+        }
+        return ans
+    }
+}
+
+fun main(args: Array<String>) {
+    val str = "abcabcdsajdhjaskld"
+    println(Solution().lengthOfLongestSubstring3(str))
+}

tips/003/README.md

@@ -40,6 +40,25 @@ class Solution {
 }
 ```
 
+```kotlin
+class Solution {
+    fun lengthOfLongestSubstring(s: String): Int {
+        val n = s.length
+        var ans = 0
+        val index = IntArray(128) // current index of character
+        // try to extend the range [i, j]
+        var j = 0
+        var i = 0
+        while (j < n) {
+            i = Math.max(index[s[j].toInt()], i)
+            ans = Math.max(ans, j - i + 1)
+            index[s[j].toInt()] = j + 1
+            j++
+        }
+        return ans
+    }
+}
+```
 
 ## 结语