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

>>阅读原文<<