-
Notifications
You must be signed in to change notification settings - Fork 1
/
4_30_2022.py
48 lines (34 loc) · 1.41 KB
/
4_30_2022.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
class Solution:
def uniqueOccurrences(self, arr):
counter_hash = {}
for num in arr:
if num in counter_hash:
counter_hash[num] += 1
else:
counter_hash[num] = 1
occurrences = counter_hash.values()
my_set = set(occurrences)
return len(occurrences) == len(my_set)
arr = [1,2,2,1,1,3]
s = Solution()
print(s.uniqueOccurrences(arr))
class Solution:
def minOperations(self, boxes: str) -> List[int]:
moves_list = []
for current_idx in range(0,len(boxes)):
total_moves = 0
left_side = boxes[0:current_idx]
for idx in reversed(range(0,len(left_side))):
print(f"left:{left_side[idx]}")
if left_side[idx] == "1":
total_moves += current_idx - idx
if current_idx + 1 < len(boxes):
right_side = boxes[current_idx+1:]
for idx, char in enumerate(right_side):
print(f"right:{char}")
if char == "1":
total_moves += (idx+1)
print(idx+1)
print(f"increment right, total moves: {total_moves}")
moves_list.append(total_moves)
return moves_list