摘要： We can use bfs to solve this problem; By traverse the prerequisites array, we can generate two graph representations. One is an array of list of out n 阅读全文

摘要： Use two pointer to find the minimum subarray size; At first, we find the shortest subarray from the first element of which the sum is greater than or 阅读全文