update

Author: ncdhz

code/289.生命游戏.py

@@ -0,0 +1,36 @@
+#
+# @lc app=leetcode.cn id=289 lang=python3
+#
+# [289] 生命游戏
+#
+# @lc code=start
+class Solution:
+ def gameOfLife(self, board: List[List[int]]) -> None:
+ """
+ Do not return anything, modify board in-place instead.
+ """
+ copy_data = [[0] * len(board[i]) for i in range(len(board))]
+ for i in range(len(board)):
+ for j in range(len(board[i])):
+ if board[i][j] == 1:
+ for m in [-1, 0, 1]:
+ if not (0 <= i + m < len(board)):
+ continue
+ for n in [-1, 0, 1]:
+ if m == 0 and n == 0:
+ continue
+ if 0 <= j + n < len(board[i]):
+ copy_data[i + m][j + n] += 1
+
+ for i in range(len(board)):
+ for j in range(len(board[i])):
+ if board[i][j] == 1:
+ if copy_data[i][j] < 2 or copy_data[i][j] > 3:
+ board[i][j] = 0
+ else:
+ board[i][j] = 1
+ elif copy_data[i][j] == 3:
+ board[i][j] = 1
+
+# @lc code=end
+

code/299.猜数字游戏.py

@@ -0,0 +1,27 @@
+#
+# @lc app=leetcode.cn id=299 lang=python3
+#
+# [299] 猜数字游戏
+#
+
+# @lc code=start
+class Solution:
+ def getHint(self, secret: str, guess: str) -> str:
+ a = 0
+ b = 0
+ aa = {}
+ bb = []
+ for i, s in enumerate(secret):
+ if guess[i] == s:
+ a += 1
+ else:
+ aa[s] = aa.get(s, 0) + 1
+ bb.append(guess[i])
+ for g in bb:
+ if g in aa and aa[g] > 0:
+ aa[g] -= 1
+ b += 1
+ 
+ return f'{a}A{b}B'
+# @lc code=end
+

code/674.最长连续递增序列.py

@@ -0,0 +1,22 @@
+#
+# @lc app=leetcode.cn id=674 lang=python3
+#
+# [674] 最长连续递增序列
+#
+
+# @lc code=start
+class Solution:
+ def findLengthOfLCIS(self, nums: List[int]) -> int:
+ num_ = 1
+ start = 1
+ for i in range(1, len(nums)):
+ num1 = nums[i - 1]
+ num2 = nums[i]
+ if num2 > num1:
+ start += 1
+ else:
+ num_ = max([start, num_])
+ start = 1
+ return max([start, num_])
+# @lc code=end
+

code/680.验证回文串-ii.py

@@ -0,0 +1,23 @@
+#
+# @lc app=leetcode.cn id=680 lang=python3
+#
+# [680] 验证回文串 II
+#
+
+# @lc code=start
+class Solution:
+ 
+ def validPalindrome_(self, s, i):
+ for j in range(len(s) // 2):
+ if s[j] != s[len(s) - 1 - j]:
+ if i == 0:
+ return self.validPalindrome_(s[j: len(s) - 1 - j], 1) | self.validPalindrome_(s[j + 1: len(s) - j], 1)
+ else:
+ return False
+
+ return True
+
+ def validPalindrome(self, s: str) -> bool:
+ return self.validPalindrome_(s, 0)
+# @lc code=end
+