add new files

Author: anakin

474. Ones and Zeroes.go

@@ -0,0 +1,34 @@
+package main
+
+func findMaxForm(strs []string, m int, n int) int {
+	dp := make([][]int, m+1)
+	for k, _ := range dp {
+		dp[k] = make([]int, n+1)
+	}
+	for _, v := range strs {
+		c0, c1 := 0, 0
+		for i := 0; i < len(v); i++ {
+			if v[i] == '1' {
+				c1++
+			} else {
+				c0++
+			}
+		}
+		if c0 > m || c1 > n {
+			continue
+		}
+		for i := m; i >= c0; i-- {
+			for j := n; j >= c1; j-- {
+				dp[i][j] = max(dp[i][j], dp[i-c0][j-c1]+1)
+			}
+		}
+	}
+	return dp[m][n]
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
+	}
+	return y
+}

491. Increasing Subsequences.go

@@ -0,0 +1,39 @@
+package main
+
+var res [][]int
+
+func isUsed(nums []int, start, index int) bool {
+	for i := start; i < index; i++ {
+		if nums[i] == nums[index] {
+			return true
+		}
+	}
+	return false
+}
+
+func findSubsequences(nums []int) [][]int {
+	res = [][]int{}
+	dfs(nums, 0, []int{})
+	return res
+
+}
+
+func dfs(nums []int, start int, tmp []int) {
+	if len(tmp) > 1 {
+		res = append(res, tmp)
+	}
+	if start == len(nums) {
+		return
+	}
+	for i := start; i < len(nums); i++ {
+		if len(tmp) > 0 && nums[i] < tmp[len(tmp)-1] {
+			continue
+		}
+		if i > start && isUsed(nums, start, i) {
+			continue
+		}
+		tmp = append(tmp, nums[i])
+		dfs(nums, i+1, tmp)
+		tmp = tmp[:len(tmp)-1]
+	}
+}

496. Next Greater Element I.go

@@ -0,0 +1,30 @@
+package main
+
+/**
+nums1 是nums2的子集，因此find方法可以找到nums1中的每个元素在nums2中的位置
+*/
+func nextGreaterElement(nums1 []int, nums2 []int) []int {
+	ret := make([]int, len(nums1))
+	for i := 0; i < len(nums1); i++ {
+		index := find(nums2, nums1[i])
+		for j := index; j < len(nums2); j++ {
+			if nums2[j] > nums1[i] {
+				ret[i] = nums2[j]
+				break
+			}
+		}
+		if ret[i] == 0 {
+			ret[i] = -1
+		}
+	}
+	return ret
+}
+
+func find(A []int, a int) int {
+	for i := 0; i < len(A); i++ {
+		if A[i] == a {
+			return i
+		}
+	}
+	return -1
+}

498. Diagonal Traverse.go

@@ -0,0 +1,33 @@
+package main
+
+func findDiagonalOrder(matrix [][]int) []int {
+	if len(matrix) == 0 {
+		return []int{}
+	}
+	r, c := 0, 0
+	m, n := len(matrix), len(matrix[0])
+	ret := make([]int, m*n)
+	for i := 0; i < m*n; i++ {
+		ret[i] = matrix[r][c]
+		if (r+c)%2 == 0 {
+			if c == n-1 {
+				r++
+			} else if r == 0 {
+				c++
+			} else {
+				r--
+				c++
+			}
+		} else {
+			if r == m-1 {
+				c++
+			} else if c == 0 {
+				r++
+			} else {
+				r++
+				c--
+			}
+		}
+	}
+	return ret
+}

503. Next Greater Element II.go

@@ -0,0 +1,29 @@
+package main
+
+/**
+把nums复制两倍，保证从任何一个位置开始，后面包含完整的数据
+*/
+
+func nextGreaterElements(nums []int) []int {
+	l := len(nums)
+	l2 := 2 * l
+	ret := make([]int, l)
+	index := make([]int, l2)
+	for i := l; i < l2; i++ {
+		index[i] = i - l
+	}
+	cur := l
+	for i := l - 1; i >= 0; i-- {
+		for cur < l2 && nums[index[cur]] <= nums[i] {
+			cur++
+		}
+		if cur == l2 {
+			ret[i] = -1
+		} else {
+			ret[i] = nums[index[cur]]
+		}
+		cur--
+		index[cur] = i
+	}
+	return ret
+}