摘要:
描述 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 i 阅读全文
posted @ 2017-04-27 16:54
larryking
阅读(182)
评论(0)
推荐(0)
摘要:
描述 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [ 2,1, 3,4, 1 阅读全文
posted @ 2017-04-27 16:32
larryking
阅读(244)
评论(0)
推荐(0)

浙公网安备 33010602011771号