feat: add kotlin solution to lc problem: No.0003

Author: Zuoqiu-Yingyi

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -26,7 +26,7 @@ tags:
 
 <pre>
 <strong>输入: </strong>s = "abcabcbb"
-<strong>输出: </strong>3 
+<strong>输出: </strong>3
 <strong>解释:</strong> 因为无重复字符的最长子串是 <code>"abc"</code>，所以其长度为 3。
 </pre>
 
@@ -309,6 +309,27 @@ proc lengthOfLongestSubstring(s: string): int =
   result = res # result has the default return value
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun lengthOfLongestSubstring(s: String): Int {
+        var char_set = BooleanArray(128)
+        var left = 0
+        var ans = 0
+        s.forEachIndexed { right, c ->
+            while (char_set[c.code]) {
+                char_set[s[left].code] = false
+                left++
+            }
+            char_set[c.code] = true
+            ans = Math.max(ans, right - left + 1)
+        }
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -307,6 +307,27 @@ proc lengthOfLongestSubstring(s: string): int =
   result = res # result has the default return value
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun lengthOfLongestSubstring(s: String): Int {
+        var char_set = BooleanArray(128)
+        var left = 0
+        var ans = 0
+        s.forEachIndexed { right, c ->
+            while (char_set[c.code]) {
+                char_set[s[left].code] = false
+                left++
+            }
+            char_set[c.code] = true
+            ans = Math.max(ans, right - left + 1)
+        }
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0000-0099/0003.Longest Substring Without Repeating Characters/Solution.kt

@@ -0,0 +1,16 @@
+class Solution {
+    fun lengthOfLongestSubstring(s: String): Int {
+        var char_set = BooleanArray(128)
+        var left = 0
+        var ans = 0
+        s.forEachIndexed { right, c ->
+            while (char_set[c.code]) {
+                char_set[s[left].code] = false
+                left++
+            }
+            char_set[c.code] = true
+            ans = Math.max(ans, right - left + 1)
+        }
+        return ans
+    }
+}