1521. 找到最接近目标值的函数值
Hard | Array, Binary Search, Bit Manipulation, Segment Tree
Hard | Array, Binary Search, Bit Manipulation, Segment Tree
Hard | Math, Design, Segment Tree, Number Theory
Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
Hard | Array, Binary Search, Design, Binary Indexed Tree, Segment Tree
Medium | Array, Binary Search, Design, Segment Tree, Ordered Set
Medium | Array, Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set
Hard | Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set
Hard | Array, Segment Tree, Sweep Line, Ordered Set
Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
Medium | Array, Dynamic Programming, Binary Indexed Tree, Segment Tree