Data Structure
Data Structure
μ μ©ν μ½λ μ 리
type
max, min
int, str,
list<append, pop, insert, del, index, reverse, sort>
sorted(some_dict.items(), lambda x: x[1], reverse=True)
reversed(some_list)
''.join(some_list)
len(some_list)
''.join(reversed(some_str))
some_str.startswith(prefix_str)
zip(items, items[1:])
enumerate(some_list)
range(0, len(some_list))
map(str, some_list)
map(''.join, permutations(items, 2))
map(''.join, combinations(items, 2))
μ°Ύκ³ μ νλ λ¬Έμμ΄Aκ° λ¬Έμμ΄Bμ 맨 μμ μλμ§ μ¬λΆ
some_str = 'abcde'
print(some_str.startswith('ab'))
print(some_str.startswith('cde'))
True
False
μλ€ κ° λΉκ΅νκΈ°
items = [1,2,3]
for i in zip(items, items[1:]):
print(i)
(1, 2)
(2, 3)
λ¬Έμμ΄ λ€μ§κΈ°
some_str = 'ABC'
print(''.join(reversed(some_str)))
CBA
리μ€νΈ & λμ λ리 μ λ ¬
some_list = {1, 2, 3}
print(sorted(some_list))
some_dict = {'a':1, 'b':2, 'c':3}
print(sorted(some_dict.items(), reverse=True))
tuple_dict = {'a':(1, 3), 'b':(2, 2), 'C':(3, 1)}
print(sorted(tuple_dict.items(), key=lambda x: x[1]))
[1, 2, 3]
[('c', 3), ('b', 2), ('a', 1)]
[('a', (1, 3)), ('b', (2, 2)), ('C', (3, 1))]
κ°μ₯ν°μ (λ¬Έμμ΄λΉκ΅λ μμ€ν€ κ°μΌλ‘ μΉνλμ΄ μ λ ¬)
numbers = [12, 10, 22]
some_list = list(map(str, numbers))
print(some_list)
some_list.sort(key=lambda x: x*3, reverse=True)
print(some_list)
print(''.join(some_list))
['12', '10', '22']
['22', '12', '10']
221210
μμ΄κ³Ό μ‘°ν©
μμ΄μ μμλλ‘ λ½λ κ²
from itertools import permutations
items = ['A', 'B', 'C']
print(list(permutations(items)))
print(list(map(''.join, permutations(items)))) # itemsμ λͺ¨λ μμλ₯Ό κ°μ§κ³ μμ΄μ λ§λ λ€.
print(list(map(''.join, permutations(items, 2)))) # 2κ°μ μμλ₯Ό κ°μ§κ³ μμ΄μ λ§λ λ€
[('A', 'B', 'C'), ('A', 'C', 'B'), ('B', 'A', 'C'), ('B', 'C', 'A'), ('C', 'A', 'B'), ('C', 'B', 'A')]
['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']
['AB', 'AC', 'BA', 'BC', 'CA', 'CB']
μ‘°ν©μ μμ΄κ³Ό λ€λ₯΄κ² λ½μμ μμλ₯Ό κ³ λ €νμ§ μλ κ² μλ₯Όλ€μ΄, 1,2,3,4 μ€ 2κ°μ μ«μλ₯Ό λ½μ μμ°μλ₯Ό λ§λλ κ²½μ° μμ΄μ 12,21κ° λμ¬ λ, μ‘°ν©μ 12λ§ λμ΄
from itertools import permutations, combinations
items = ['1', '2', '3']
print("μμ΄:{}".format(list(map(''.join, permutations(items, 1)))))
print("μμ΄:{}".format(list(permutations(items, 2))))
print("μμ΄:{}".format(list(map(''.join, permutations(items, 2)))))
print("μ‘°ν©:{}".format(list(map(''.join, combinations(items, 1))))) # μ‘°ν©μ λ§λ€λ €λ μμ΄ν
κ³Ό μ‘°ν©μ μλ₯Ό λ°λμλ겨μ€μΌνλ€.
print("μ‘°ν©:{}".format(list(combinations(items, 2))))
print("μ‘°ν©:{}".format(list(map(''.join, combinations(items, 2)))))
μμ΄:['1', '2', '3']
μμ΄:[('1', '2'), ('1', '3'), ('2', '1'), ('2', '3'), ('3', '1'), ('3', '2')]
μμ΄:['12', '13', '21', '23', '31', '32']
μ‘°ν©:['1', '2', '3']
μ‘°ν©:[('1', '2'), ('1', '3'), ('2', '3')]
μ‘°ν©:['12', '13', '23']
μμμ°ΎκΈ°
def prime_check(n):
if n < 2:
return False
for i in range(2, n):
if n % i == 0:
return False
return True
print(prime_check(1))
print(prime_check(2))
print(prime_check(3))
print(prime_check(9))
False
True
True
False
λ§€λ² μ λ ¬μ΄ νμν κ²½μ° μ¬μ©
import heapq
l = [3,2,1]
heapq.heapify(l)
print(l)
print(heapq.heappop(l))
print(l)
heapq.heappush(l, 4)
print(l)
[1,2,3]
1
[2,3]
[2,3,4]
Last updated
Was this helpful?