larryking

摘要： 描述 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 阅读全文

摘要： 描述 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 阅读全文