摘要:
Maximum Subarray DifferenceGiven an array with integers.Find twonon-overlappingsubarrays A and B, which|SUM(A) - SUM(B)|is thelargest.Return the large... 阅读全文
posted @ 2015-06-17 15:17
Eason Liu
阅读(252)评论(0)推荐(0)
编辑
摘要:
Max Sum of Max-K-sub-sequenceProblem DescriptionGiven a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is ... 阅读全文
posted @ 2015-06-17 11:12
Eason Liu
阅读(311)评论(0)推荐(0)
编辑
摘要:
Count of Smaller Number before itselfGive you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) . For e... 阅读全文
posted @ 2015-06-14 20:24
Eason Liu
阅读(1198)评论(0)推荐(0)
编辑
摘要:
Max TreeGiven an integer array with no duplicates. A max tree building on this array is defined as follow:The root is the maximum number in the arrayT... 阅读全文
posted @ 2015-06-11 16:15
Eason Liu
阅读(1105)评论(0)推荐(0)
编辑
摘要:
Implement Stack using QueuesImplement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the eleme... 阅读全文
posted @ 2015-06-11 11:12
Eason Liu
阅读(2085)评论(1)推荐(0)
编辑
摘要:
Maximum Subarray IIIGiven an array of integers and a numberk, find knon-overlappingsubarrays which have the largest sum.The number in each subarray sh... 阅读全文
posted @ 2015-06-10 18:11
Eason Liu
阅读(1215)评论(0)推荐(0)
编辑
摘要:
Rectangle AreaFind the total area covered by tworectilinearrectangles in a2Dplane.Each rectangle is defined by its bottom left corner and top right co... 阅读全文
posted @ 2015-06-08 12:30
Eason Liu
阅读(3537)评论(1)推荐(1)
编辑