shuuji3.xyz
[READ-ONLY] Mirror of https://github.com/shuuji3/leetcode. 📃 Code submitted to LeetCode
leetcode.com/shuuji3/
leetcode
leetcode-solutions
Add solutions and note for Weekly Contest 168.
author
TAKAHASHI Shuuji
date
(Dec 22, 2019, 3:57 PM +0900)
commit
31593c22
31593c2229b30e93f58dc9343f26e866df1bd960
parent
83708e4e
83708e4ed6f57b07b8300116c341bc6b37c4f55d
+35
+4
weekly-contest-168/5291.find-numbers-with-even-number-of-digits.py
+4
weekly-contest-168/5291.find-numbers-with-even-number-of-digits.py
+16
weekly-contest-168/5292.divide-array-in-sets-of-k-consecutive-numbers.tle.py
+16
weekly-contest-168/5292.divide-array-in-sets-of-k-consecutive-numbers.tle.py
···
1
+
class Solution:
2
+
def isPossibleDivide(self, nums: List[int], k: int) -> bool:
3
+
# In case of non multiple
4
+
if len(nums) % k != 0:
5
+
return False
6
+
7
+
sorted_nums = sorted(nums)
8
+
for _ in range(len(nums) // k):
9
+
first_num = sorted_nums[0]
10
+
for i in range(k):
11
+
target_num = first_num + i
12
+
if target_num in sorted_nums:
13
+
sorted_nums.pop(sorted_nums.index(target_num))
14
+
else:
15
+
return False
16
+
return True
+12
weekly-contest-168/5293.maximum-number-of-occurrences-of-a-substring.wa.py
+12
weekly-contest-168/5293.maximum-number-of-occurrences-of-a-substring.wa.py
···
1
+
class Solution:
2
+
def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int:
3
+
substring_count = 0
4
+
for start in range(len(s) - minSize + 1):
5
+
for end in range(start + minSize - 1, start + maxSize):
6
+
substring = s[start:end+1]
7
+
letters_num = len(set(substring))
8
+
if letters_num <= maxLetters:
9
+
substring_count += 1
10
+
else:
11
+
break
12
+
return substring_count