2017年2月10日
Course Schedule Leetcode
摘要： There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have t 阅读全文
posted @ 2017-02-10 12:47 璨璨要好好学习 阅读(139) 评论(0) 推荐(0)
Implement Stack using Queues Leetcode
摘要： Implement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. to 阅读全文
posted @ 2017-02-10 11:22 璨璨要好好学习 阅读(126) 评论(0) 推荐(0)
Graph Valid Tree Leetcode
摘要： Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges mak 阅读全文
posted @ 2017-02-10 03:52 璨璨要好好学习 阅读(155) 评论(0) 推荐(0)
Clone Graph Leetcode
摘要： Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled 阅读全文
posted @ 2017-02-10 02:41 璨璨要好好学习 阅读(185) 评论(0) 推荐(0)