Merge branch 'master' of github.com:xemxx/leetcode

Author: xemxx

.gitignore

@@ -1,4 +1,5 @@
 .vscode
 done/question
 .DS_Store
-.idea/*
+.idea/*
+cn

leetcode/done/算法/122.买卖股票的最佳时机-ii.go

@@ -3,6 +3,7 @@
  *
  * [122] 买卖股票的最佳时机 II
  */
+package leetcode
 
 // @lc code=start
 func maxProfit(prices []int) int {
@@ -16,4 +17,3 @@ func maxProfit(prices []int) int {
 }
 
 // @lc code=end
-

leetcode/done/算法/334.递增的三元子序列.go

@@ -0,0 +1,30 @@
+/*
+ * @lc app=leetcode.cn id=334 lang=golang
+ *
+ * [334] 递增的三元子序列
+ */
+package leetcode
+
+import "math"
+
+// @lc code=start
+func increasingTriplet(nums []int) bool {
+	// i, j, k := 0, 1, 2
+	if len(nums) < 3 {
+		return false
+	}
+	first, last := nums[0], math.MaxInt
+	for _, v := range nums[1:] {
+		if v > last {
+			return true
+		}
+		if v > first {
+			last = v
+		} else {
+			first = v
+		}
+	}
+	return false
+}
+
+// @lc code=end

leetcode/每日一题/2363.合并相似的物品.go

@@ -0,0 +1,38 @@
+/*
+ * @lc app=leetcode.cn id=2363 lang=golang
+ *
+ * [2363] 合并相似的物品
+ */
+package leetcode
+
+// @lc code=start
+func mergeSimilarItems(items1 [][]int, items2 [][]int) [][]int {
+	keyM := make([]int, 1001)
+	// valM := make(map[int]int)
+	for i := range keyM {
+		keyM[i] = -1
+	}
+	for _, v := range items1 {
+		keyM[v[0]] = 0
+		keyM[v[0]] = v[1]
+	}
+	for _, v := range items2 {
+		if keyM[v[0]] == -1 {
+			keyM[v[0]] = 0
+		}
+		keyM[v[0]] += v[1]
+	}
+	maxLen := len(items1)
+	if len(items2) > maxLen {
+		maxLen = len(items2)
+	}
+	v := make([][]int, 0, maxLen)
+	for kk, vv := range keyM {
+		if vv > 0 {
+			v = append(v, []int{kk, keyM[kk]})
+		}
+	}
+	return v
+}
+
+// @lc code=end

leetcode/每日一题/2373.矩阵中的局部最大值.go

@@ -0,0 +1,29 @@
+/*
+ * @lc app=leetcode.cn id=2373 lang=golang
+ *
+ * [2373] 矩阵中的局部最大值
+ */
+
+// @lc code=start
+func largestLocal(grid [][]int) [][]int {
+	result := make([][]int, len(grid)-2)
+	for i := 0; i < len(grid)-2; i++ {
+		for j := 0; j < len(grid[i])-2; j++ {
+			m := 0
+			for k := 0; k < 3; k++ {
+				for d := 0; d < 3; d++ {
+					m = max(grid[i+k][j+d], m)
+				}
+			}
+			if result[i] == nil {
+				result[i] = make([]int, len(grid)-2)
+			}
+			result[i][j] = m
+		}
+	}
+	return result
+
+}
+
+// @lc code=end
+

leetcode/贪心/392.判断子序列.go

@@ -0,0 +1,28 @@
+/*
+ * @lc app=leetcode.cn id=392 lang=golang
+ *
+ * [392] 判断子序列
+ */
+
+// @lc code=start
+func isSubsequence(s string, t string) bool {
+	if len(s) == 0 {
+		return true
+	}
+	if len(s) > len(t) {
+		return false
+	}
+	si := 0
+	for i := 0; i < len(t); i++ {
+		if s[si] == t[i] {
+			si++
+			if si == len(s) {
+				return true
+			}
+		}
+	}
+	return false
+}
+
+// @lc code=end
+