2017年3月23日
Leetcode 530. Minimum Absolute Difference in BST
摘要： Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Note: There are at 阅读全文
posted @ 2017-03-23 23:06 Deribs4 阅读(449) 评论(0) 推荐(0)
Leetcode 532. K-diff Pairs in an Array
摘要： 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 inte 阅读全文
posted @ 2017-03-23 16:40 Deribs4 阅读(1136) 评论(0) 推荐(0)