leetcode練習 532 python實現（字典方式和二分搜索）

題532 題目要求在一個list中尋找差爲固定值的pair的數量，具體以下： Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i

>>阅读原文<<