导航

2015年8月9日

摘要: 1.BFS实现public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { int[] incLinkCounts = new int[numCourses]; ... 阅读全文

posted @ 2015-08-09 22:15 骄阳照林 阅读(664) 评论(0) 推荐(0) 编辑

摘要: There are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 you have to firs... 阅读全文

posted @ 2015-08-09 21:40 骄阳照林 阅读(112) 评论(0) 推荐(0) 编辑

摘要: There are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 you have to firs... 阅读全文

posted @ 2015-08-09 14:11 骄阳照林 阅读(224) 评论(0) 推荐(0) 编辑

摘要: Given an array of integers, find out whether there are two distinct indicesiandjin the array such that the difference betweennums[i]andnums[j]is at mo... 阅读全文

posted @ 2015-08-09 12:15 骄阳照林 阅读(136) 评论(0) 推荐(0) 编辑