[Baekjoon]2467. 용액 Algorithm binary search How to Solve Constraint 시간: 1초 메모리: 128 MB 2 abs(target): min_dif = abs(target) a, b = arr[start], arr[end] if target == 0: break elif target 0: end -= 1 print(a, b) Study | 성장기록/Algorithm 2024.04.17