func findMaxConsecutiveOnes(nums []int) int {max :=0for i,j :=0,-1; i <len(nums); i++{if nums[i]==0{j = i}else{if max < i -j {max = i - j}}}return max
}
官解
func lengthOfLongestSubstring(s string) int {n : len(s)ans : 0subMap : make(map[byte]int)for i, j : 0, 0; j < n; j {if v, ok : subMap[byte(s[j])]; ok {if i < v {i v}}if ans < (j - i 1) {ans j - i 1}subMap[byte(s[j])] j 1}return ans
}
借用arraystack的包完成
import "github.com/emirpasic/gods/stacks/arraystack"func isValid(s string) bool {stack : arraystack.New()for _, c : range s {if c ( {stack.Push())} else if c [ {stack.Push(])} else if c { {stack.Push(})} else {if stack.…