0003

Author: ruoru

Algorithms/0003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.rs

@@ -1,27 +1,45 @@
-package problem0003
-
-func lengthOfLongestSubstring(s string) int {
-	// location[s[i]] == j 表示：
-	// s中第i个字符串，上次出现在s的j位置，所以，在s[j+1:i]中没有s[i]
-	// location[s[i]] == -1 表示： s[i] 在s中第一次出现
-	location := [256]int{} // 只有256长是因为，假定输入的字符串只有ASCII字符
-	for i := range location {
-		location[i] = -1 // 先设置所有的字符都没有见过
-	}
-
-	maxLen, left := 0, 0
-
-	for i := 0; i < len(s); i++ {
-		// 说明s[i]已经在s[left:i+1]中重复了
-		// 并且s[i]上次出现的位置在location[s[i]]
-		if location[s[i]] >= left {
-			left = location[s[i]] + 1 // 在s[left:i+1]中去除s[i]字符及其之前的部分
-		} else if i+1-left > maxLen {
-			// fmt.Println(s[left:i+1])
-			maxLen = i + 1 - left
-		}
-		location[s[i]] = i
-	}
-
-	return maxLen
+use std::cmp::max;
+
+pub fn longest_substring_without_repeating_characters (s: String) -> usize {
+
+    let mut start = 0;
+    let mut end = 0;
+
+    let s_length = s.len();
+    let mut sub_strings: Vec<char> = vec![];
+
+    let mut result = 0;
+
+    while end < s_length {
+        let c = s.chars().nth(end).unwrap();
+
+        let mut loop_finish = true;
+        let mut i = 0;
+        for vv in sub_strings.iter() {
+            if vv == &c {
+                start = i + start + 1;
+                end = start - 1;
+                loop_finish = false;
+                sub_strings = vec![];
+                break;
+            }
+            i += 1;
+        }
+
+        if loop_finish {
+            sub_strings.push(c);
+        }
+
+        end += 1;
+        result = max(result, end - start);
+    }
+
+    return result;
+}
+
+fn main() {
+    let s = String::from("Hello world");
+    let result = longest_substring_without_repeating_characters(s);
+
+    println!("{}", result);
 }

Algorithms/0003.longest-substring-without-repeating-characters/longest-substring-without-repeating-characters_test.rs

@@ -1,56 +0,0 @@
-package problem0003
-
-import (
-	"testing"
-
-	"github.com/stretchr/testify/assert"
-)
-
-type para struct {
-	one string
-}
-
-type ans struct {
-	one int
-}
-
-type question struct {
-	p para
-	a ans
-}
-
-func Test_OK(t *testing.T) {
-	ast := assert.New(t)
-
-	qs := []question{
-		question{
-			p: para{
-				one: "abcabcbb",
-			},
-			a: ans{
-				one: 3,
-			},
-		},
-		question{
-			p: para{
-				one: "bbbbbbbb",
-			},
-			a: ans{
-				one: 1,
-			},
-		},
-		question{
-			p: para{
-				one: "pwwkew",
-			},
-			a: ans{
-				one: 3,
-			},
-		},
-	}
-
-	for _, q := range qs {
-		a, p := q.a, q.p
-		ast.Equal(a.one, lengthOfLongestSubstring(p.one), "输入:%v", p)
-	}
-}

README.md

@@ -14,4 +14,5 @@ leetcode in rust lang.
 |order|topic|passing rate|difficult|collection|
 |:-:|:-|:-:|:-:|:-:|
 |1|[Two Sum](./Algorithms/0001.two-sum)|39%|Easy||
-|2|[Add Two Numbers](./Algorithms/0002.add-two-numbers)|29%|Medium||
+|2|[Add Two Numbers](./Algorithms/0002.add-two-numbers)|29%|Medium||
+|3|[Longest Substring Without Repeating Characters](./Algorithms/0003.longest-substring-without-repeating-characters)|25%|Medium||