update

Author: ncdhz

code/164.最大间距.py

@@ -0,0 +1,47 @@
+#
+# @lc app=leetcode.cn id=164 lang=python3
+#
+# [164] 最大间距
+#
+
+# @lc code=start
+class Solution:
+
+ def maximumGap(self, nums: List[int]) -> int:
+ if len(nums) < 2:
+ return 0
+ 
+ buf = [0] * len(nums)
+ 
+ sign = 1
+ max_num = max(nums)
+ 
+ while max_num >= sign:
+ bucket = [0] * 10
+ for num in nums:
+ bucket[num // sign % 10] += 1
+ 
+ for i in range(1, 10):
+ bucket[i] += bucket[i - 1]
+ 
+ for i in range(len(nums) - 1, -1, -1):
+ num = nums[i]
+ n = num // sign % 10
+ buf[bucket[n] - 1] = num
+ bucket[n] -= 1
+ sign *= 10
+ 
+ if max_num >= sign: 
+ for i, num in enumerate(buf):
+ nums[i] = num
+
+ res = 0
+ for i in range(1, len(buf)):
+ b = buf[i] - buf[i - 1]
+ if b > res:
+ res = b
+
+ return res 
+
+# @lc code=end
+

code/241.为运算表达式设计优先级.py

@@ -0,0 +1,41 @@
+#
+# @lc app=leetcode.cn id=241 lang=python3
+#
+# [241] 为运算表达式设计优先级
+#
+
+# @lc code=start
+class Solution:
+
+ def diffWaysToCompute_(self, numbers, symbols):
+ if len(symbols) == 0:
+ return numbers
+ res = []
+ for i in range(1, len(numbers)):
+ symbol = symbols[i - 1]
+ if symbol == '+':
+ number = numbers[i] + numbers[i - 1]
+ elif symbol == '-':
+ number = numbers[i - 1] - numbers[i]
+ else:
+ number = numbers[i] * numbers[i - 1]
+
+ res.extend(self.diffWaysToCompute_([*numbers[:i-1], number, *numbers[i+1:]], [*symbols[:i - 1], *symbols[i:]]))
+ return res
+
+
+ def diffWaysToCompute(self, expression: str) -> List[int]:
+ numbers = []
+ symbols = []
+ number = ''
+ for exp in expression:
+ if '0' <= exp <= '9':
+ number += exp
+ else:
+ numbers.append(int(number))
+ number = ''
+ symbols.append(exp)
+ numbers.append(int(number))
+ return self.diffWaysToCompute_(numbers, symbols)
+
+# @lc code=end

code/682.棒球比赛.py

@@ -0,0 +1,31 @@
+#
+# @lc app=leetcode.cn id=682 lang=python3
+#
+# [682] 棒球比赛
+#
+
+# @lc code=start
+class Solution:
+ def calPoints(self, operations: List[str]) -> int:
+ sum_ = 0
+ scores = []
+
+ for operation in operations:
+ if operation == '+':
+ n = scores[-1] + scores[-2]
+ sum_ += n
+ scores.append(n)
+ elif operation == 'D':
+ n = scores[-1] * 2
+ sum_ += n
+ scores.append(n)
+ elif operation == 'C':
+ score = scores.pop()
+ sum_ -= score
+ else:
+ n = int(operation)
+ scores.append(n)
+ sum_ += n
+ return sum_
+# @lc code=end
+

code/693.交替位二进制数.py

@@ -0,0 +1,21 @@
+#
+# @lc app=leetcode.cn id=693 lang=python3
+#
+# [693] 交替位二进制数
+#
+
+# @lc code=start
+class Solution:
+ def hasAlternatingBits(self, n: int) -> bool:
+ start = n % 2
+ n //= 2
+ while n > 0:
+ back = n % 2
+ n //= 2
+ if start == back:
+ return False
+ start = back
+ 
+ return True
+# @lc code=end
+

code/696.计数二进制子串.py

@@ -0,0 +1,25 @@
+#
+# @lc app=leetcode.cn id=696 lang=python3
+#
+# [696] 计数二进制子串
+#
+
+# @lc code=start
+class Solution:
+ def countBinarySubstrings(self, s: str) -> int:
+ sign = -1
+ sum_ = 0
+ for i in range(1, len(s)):
+ if s[i] != s[i- 1]:
+ sum_ += 1
+ sign = i - 2
+ elif sign > -1:
+ if s[i] != s[sign]:
+ sum_ += 1
+ sign -= 1
+ else:
+ sign = -1
+
+ return sum_
+# @lc code=end
+

code/697.数组的度.py

@@ -0,0 +1,25 @@
+#
+# @lc app=leetcode.cn id=697 lang=python3
+#
+# [697] 数组的度
+#
+
+# @lc code=start
+class Solution:
+ def findShortestSubArray(self, nums: List[int]) -> int:
+ max_key = -1
+ res = {}
+ for i, num in enumerate(nums):
+ msg = res.get(num, [0, i, i])
+ msg[0] += 1
+ msg[2] = i
+ res[num] = msg
+
+ max_msg = res.get(max_key)
+ if max_key == -1 or max_msg[0] < msg[0] or(max_msg[0] == msg[0] and max_msg[2] - max_msg[1] > msg[2] - msg[1]):
+ max_key = num
+
+ msg = res.get(max_key)
+ return msg[2] - msg[1] + 1
+# @lc code=end
+