공부하는 개발 블로그

https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/submissions/

class Solution: 
    def findDisappearedNumbers(self, nums: List[int]) -> List[int]: 
        for i in range(len(nums)): 
            c = 0 
            while nums[i] != nums[nums[i]-1] and nums[i] != i+1 : 
                if c > 4: break 
                print(nums, nums[i], nums[nums[i]-1])
                # right
                nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i] 
                # wrong
                #nums[nums[i]-1], nums[i] = nums[i], nums[nums[i]-1] 
                c+=1 

dict.pop(key, None)

D_index = {k: v for k, v in enumerate(D)}

Make pairs

returns iterator

x = ['a', 'b', 'c']
y = [1, 2]

zipped = list(zip(x, y))
# [('a', 1), ('b', 2)]

x2, y2 = zip(*zip(x, y))
# x2 = ['a', 'b']
# y2 = [1, 2]

maketrans()

translate()

maketrans(s1,s2,s3):

s1[i]를 s2[i]로 replace & s3 제거

table = maketrans(s1,s2,s3)

str.translate(table)

str을 table대로 변환

# a->x, b->y, c->z로 replace.
# k는 delete
# 하는 mapping을 만든다

s = "xkplky"
table = s.maketrans('abc', 'xyz', 'k')
s.translate(table)
# "aplb"

# translation table from dictionary
# a->'', c->z
translation = {97: None, 99: 122}

s = "abcdef"

# translate string
s.translate(translation)
#bzdef