Commit c93fd34

author

Openset

committed

Add: longest_substring_without_repeating_characters

1 parent fe19fd6 commit c93fd34Copy full SHA for c93fd34

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,16 @@`
`1`	`1`	`package longest_substring_without_repeating_characters`
	`2`	`+`
	`3`	`+func lengthOfLongestSubstring(s string) int {`
	`4`	`+ ans, l := 0, len(s)`
	`5`	`+ index := [128]int{}`
	`6`	`+ for i, j := 0, 0; j < l; j++ {`
	`7`	`+ if i < index[s[j]] {`
	`8`	`+ i = index[s[j]]`
	`9`	`+ }`
	`10`	`+ if ans < j-i+1 {`
	`11`	`+ ans = j - i + 1`
	`12`	`+ }`
	`13`	`+ index[s[j]] = j + 1`
	`14`	`+ }`
	`15`	`+ return ans`
	`16`	`+}`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1 +1,19 @@`
`1`	`1`	`package longest_substring_without_repeating_characters`
	`2`	`+`
	`3`	`+import "testing"`
	`4`	`+`
	`5`	`+func TestLengthOfLongestSubstring(t *testing.T) {`
	`6`	`+ tests := map[string]int{`
	`7`	`+ "abcabcbb": 3,`
	`8`	`+ "bbbbb": 1,`
	`9`	`+ "pwwkew": 3,`
	`10`	`+ "abcdef": 6,`
	`11`	`+ }`
	`12`	`+`
	`13`	`+ for input, expected := range tests {`
	`14`	`+ output := lengthOfLongestSubstring(input)`
	`15`	`+ if output != expected {`
	`16`	`+ t.Fatalf("input: %v, output: %v, expected: %v", input, output, expected)`
	`17`	`+ }`
	`18`	`+ }`
	`19`	`+}`

Comments

(0)