bisect
- bisect : νμ΄μ¬μμ μ΄μ§νμμ μ½κ² ꡬννκΈ° μν΄ μ 곡νλ λΌμ΄λΈλ¬λ¦¬μ΄λ€.
- μ λ ¬λ λ°°μ΄μμ νΉμ ν μμλ₯Ό μ°ΎμμΌν λ μμ£Ό μ¬μ©λλ€.
- bisect_left(), bisect_right() ν¨μκ° κ°μ₯ μ€μνκ² μ¬μ©λλ€.
bisect_left, bisect_right
- bisect_left(list, n) : μ λ ¬λ μμλ₯Ό μ μ§νλ©° 리μ€νΈ listμ λ°μ΄ν° nμ μ½μ ν κ°μ₯ μΌμͺ½ μΈλ±μ€λ₯Ό μ°Ύλλ€.
- bisect_right(list, n) : μ λ ¬λ μμλ₯Ό μ μ§νλ©° 리μ€νΈ listμ λ°μ΄ν° nμ μ½μ ν κ°μ₯ μ€λ₯Έμͺ½ μΈλ±μ€λ₯Ό μ°Ύλλ€.
- bisect_left(list, n, lo = 0, hi = len(list)) : loμ hiλ κ³ λ €ν 리μ€νΈμ λΆλΆμ§ν©μ μ§μ νλ λ° μ¬μ©λλ€.
μμ
from bisect import bisect_left, bisect_right
list = [1, 3, 3, 5, 7, 8, 10]
x = 3
y = 8
print(bisect_left(list, x))
print(bisect_right(list, x))
'''
3
3
'''
print(bisect_left(list, y))
print(bisect_right(list, y))
'''
5
6
'''
'ΰ¨βββ Studyβββΰ§ > β Algorithm' μΉ΄ν κ³ λ¦¬μ λ€λ₯Έ κΈ
[python] μμ΄κ³Ό μ‘°ν© (0) | 2021.07.20 |
---|---|
[μκ³ λ¦¬μ¦] BFS(Breadth First Search) (0) | 2021.05.12 |
[μκ³ λ¦¬μ¦] DFS(Depth First Search, κΉμ΄ μ°μ νμ) (0) | 2021.05.04 |
[Python] μ λ ¬ μκ³ λ¦¬μ¦ (0) | 2021.04.19 |
[Python] tuple (0) | 2021.04.06 |