2015年9月11日
Continuous Subarray Sum II
摘要： Description: Given an integer array, find a continuous rotate subarray where the sum of numbers is the biggest. Your code should return the index of ... 阅读全文
posted @ 2015-09-11 20:42 影湛 阅读(121) 评论(0) 推荐(0)
Best Time to Buy and Sell Stock III
摘要： Description: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit.... 阅读全文
posted @ 2015-09-11 03:49 影湛 阅读(97) 评论(0) 推荐(0)
Find the Weak Connected Component in the Directed Graph
摘要： Description: Find the number Weak Connected Component in the directed graph. Each node in the graph contains a label and a list of its neighbors. (a ... 阅读全文
posted @ 2015-09-11 01:50 影湛 阅读(206) 评论(0) 推荐(0)