Leveraging Programming Languages: Python Lang.

m_ngyeongยท2025๋…„ 4์›” 8์ผ
0
post-thumbnail

10. Leveraging Programming Languages


Python Lang.

โŒ ๋”•์…”๋„ˆ๋ฆฌ ํ‚ค์™€ in ์—ฐ์‚ฐ์ž

d = {'a': 1, 'b': 2}
print('a' in d, 1 in d)

๐Ÿ–๏ธ True False

  • 'a' in d โ†’ True (ํ‚ค ์ฒดํฌ)
  • 1 in d โ†’ False (๊ฐ’์€ ์•„๋‹˜!)

โœ… set์˜ ์ค‘๋ณต ์ œ๊ฑฐ + ์ •๋ ฌ

s = set([3, 1, 2, 3, 2])
print(sorted(s))

๐Ÿ–๏ธ [1,2,3]

  • set์€ ์ค‘๋ณต์„ ์ œ๊ฑฐํ•จ

โŒ ๋”•์…”๋„ˆ๋ฆฌ ๊ฐ’ ๊ธฐ์ค€ ์ •๋ ฌ : lambda

d = {'apple': 3, 'banana': 1, 'cherry': 2}
print(sorted(d.items(), key=lambda x: x[1]))

๐Ÿ–๏ธ [('banana', 1), ('cherry', 2), ('apple', 3)]

  • d.items() โ†’ [('apple', 3), ('banana', 1), ('cherry', 2)]
  • ๊ฐ’ ๊ธฐ์ค€ ์ •๋ ฌ โ†’ [('banana', 1), ('cherry', 2), ('apple', 3)]

โŒ enumerate์™€ unpacking

lst = ['a', 'b', 'c']
for idx, val in enumerate(lst, start=1):
    if idx == 2:
        print(val)

๐Ÿ–๏ธ 'b'

  • for idx, val in enumerate(lst, start=1):
    ๊ตฌ๋ฌธ์— ์˜ํ•ด index๋Š” 1๋ถ€ํ„ฐ ์‹œ์ž‘
  • idx=2์ผ ๋•Œ val โ†’ 'b'

โŒ set ์—ฐ์‚ฐ

a = {1, 2, 3}
b = {3, 4, 5}
print(a & b, a | b)

๐Ÿ–๏ธ {3} {1, 2, 3, 4, 5}

  • a & b โ†’ {3}
  • a | b โ†’ {1, 2, 3, 4, 5}

โŒ ๋”•์…”๋„ˆ๋ฆฌ .get() ๋ฉ”์„œ๋“œ

d = {'x': 10}
print(d.get('x'), d.get('y'), d.get('y', 'N/A'))

๐Ÿ–๏ธ 10 None 'N/A'

  • d.get('x') โ†’ 10
  • d.get('y') โ†’ None
  • d.get('y', 'N/A') โ†’ 'N/A'

โœ… lambda์™€ map

nums = [1, 2, 3]
result = list(map(lambda x: x * 2, nums))
print(result)

๐Ÿ–๏ธ [2, 4, 6]

โœ… filter์™€ lambda

nums = [0, 1, 2, 3, 4]
result = list(filter(lambda x: x % 2 == 0, nums))
print(result)

๐Ÿ–๏ธ [0, 2, 4]

  • ์ง์ˆ˜๋งŒ ์ถœ๋ ฅ

โŒ set์˜ ๋ถˆ๋ณ€์„ฑ

s = {1, 2, 3}
try:
    s.add([4, 5])
except Exception as e:
    print(type(e).__name__)

๐Ÿ–๏ธ TypeError

  • ๋ฆฌ์ŠคํŠธ๋Š” hashable ์•„๋‹˜ โ†’ TypeError
  • ๋ฆฌ์ŠคํŠธ๋Š” set์— ๋ชป ๋“ค์–ด๊ฐ

โœ… sorted์˜ key ํ•จ์ˆ˜์™€ reverse

words = ["apple", "banana", "kiwi"]
print(sorted(words, key=lambda x: len(x), reverse=True))

๐Ÿ–๏ธ ["banana", "apple", "kiwi"]

  • key=lambda x: len(x) โ†’ [5, 6, 4]
  • sorted(words) โ†’ ["kiwi", "apple", "banana"]
  • reverse=True โ†’ ["banana", "apple", "kiwi"]
profile
สšศ‰ษž

0๊ฐœ์˜ ๋Œ“๊ธ€