commit 122/136

Author: forgeyao

122/122-maxProfit.go

@@ -0,0 +1,26 @@
+// https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
+package main
+
+import "fmt"
+
+func maxProfit(prices []int) int {
+	profit := 0
+	min, length := prices[0], len(prices)
+	for i := 1; i < length; i++ {
+		if prices[i] < prices[i-1] {
+			profit += prices[i-1] - min
+			min = prices[i]
+		}
+	}
+	if min < prices[length-1] {
+		profit += prices[length-1] - min
+	}
+	return profit
+}
+
+func main() {
+	n := [][]int{{7, 1, 5, 3, 6, 4}, {1, 2, 3, 4, 5}, {7, 6, 4, 3, 1}}
+	for i := 0; i < len(n); i++ {
+		fmt.Println("ret:", maxProfit(n[i]))
+	}
+}

136/136-singleNumber.go

@@ -0,0 +1,19 @@
+// https://leetcode-cn.com/problems/single-number/
+package main
+
+import "fmt"
+
+func singleNumber(nums []int) int {
+	ret := nums[0]
+	for i := 1; i < len(nums); i++ {
+		ret = ret ^ nums[i]
+	}
+	return ret
+}
+
+func main() {
+	n := [][]int{{2, 2, 1}, {4, 1, 2, 1, 2}}
+	for i := 0; i < len(n); i++ {
+		fmt.Println("ret:", singleNumber(n[i]))
+	}
+}

README.md

@@ -37,6 +37,8 @@ LeetCode
 |118|[杨辉三角](https://leetcode-cn.com/problems/pascals-triangle/)|[Go](./118/118-generate.go)|简单||
 |119|[杨辉三角 II](https://leetcode-cn.com/problems/pascals-triangle-ii/)|[Go](./119/119-getRow.go)|简单||
 |121|[买卖股票的最佳时机](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/)|[Go](./121/121-maxProfit.go)|简单||
+|122|[买卖股票的最佳时机 II](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/)|[Go](./122/122-maxProfit.go)|简单|贪心|
+|136|[只出现一次的数字](https://leetcode-cn.com/problems/single-number/)|[Go](./136/136-singleNumber.go)|简单|位运算|
 |125|[验证回文串](https://leetcode-cn.com/problems/valid-palindrome/)|[Go](./125-isPalindrome/125-isPalindrome.go)|简单||
 |131|[分割回文串](https://leetcode-cn.com/problems/palindrome-partitioning/) | [Go](./131-partition/131-partition.go)|中等|递归, 动态规划|
 |141|[环形链表](https://leetcode-cn.com/problems/linked-list-cycle/)|[Go](./141-hasCycle/141-hasCycle.go)|简单|双指针|