流白 - 博客园

2015年10月27日

摘要： https://leetcode.com/problems/sliding-window-maximum/Given an arraynums, there is a sliding window of sizekwhich is moving from the very left of the a... 阅读全文

posted @ 2015-10-27 13:55 流白阅读(206) 评论(0) 推荐(0) 编辑

leetcode@ [295]Find Median from Data Stream

摘要： https://leetcode.com/problems/find-median-from-data-stream/Median is the middle value in an ordered integer list. If the size of the list is even, the... 阅读全文

posted @ 2015-10-27 12:40 流白阅读(263) 评论(0) 推荐(0) 编辑

2015年10月26日

algorithm@ 大素数判定和大整数质因数分解

摘要： #include#include#include#include#include#includeusing namespace std;//****************************************************************// Miller_Rabin ... 阅读全文

posted @ 2015-10-26 15:17 流白阅读(310) 评论(0) 推荐(0) 编辑

2015年10月24日

dataStructure@ Check whether a given graph is Bipartite or not

摘要： Check whether a given graph is Bipartite or notABipartite Graphis a graph whose vertices can be divided into two independent sets, U and V such that e... 阅读全文

posted @ 2015-10-24 10:09 流白阅读(184) 评论(0) 推荐(0) 编辑

2015年10月23日

leetcode@ [210]Course Schedule II

摘要： Course Schedule IITotal Accepted:13015Total Submissions:64067Difficulty:MediumThere are a total ofncourses you have to take, labeled from0ton - 1.Some... 阅读全文

posted @ 2015-10-23 23:14 流白阅读(269) 评论(0) 推荐(0) 编辑

dataStructure@ Find if there is a path between two vertices in a directed graph

摘要： Given a Directed Graph and two vertices in it, check whether there is a path from the first given vertex to second.For example, in the following graph... 阅读全文

posted @ 2015-10-23 19:48 流白阅读(276) 评论(0) 推荐(0) 编辑

leetcode@ [207] Course Schedule

摘要： 1 struct edge{ 2 int to,cost; 3 edge(){ this->to = 0; this->cost = 0;} 4 edge(int t){ this->to = t; this->cost = 0;} 5 }; 6 class Solutio... 阅读全文

posted @ 2015-10-23 19:15 流白阅读(151) 评论(0) 推荐(0) 编辑

leetcode@ [62/63] Unique Paths II

摘要： 1 class Solution { 2 public: 3 int uniquePathsWithObstacles(vector>& obstacleGrid) { 4 if(obstacleGrid.size()==0 || obstacleGrid[0].size(... 阅读全文

posted @ 2015-10-23 14:53 流白阅读(180) 评论(0) 推荐(0) 编辑

dataStructure@ Check if a directed graph has cycles

摘要： 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 const int maxn = 10; 8 struct edge{ 9 int to, cost;10 edge(in... 阅读全文

posted @ 2015-10-23 11:05 流白阅读(305) 评论(0) 推荐(0) 编辑

2015年10月22日

dataStructure@ Binary Search Tree

摘要： 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 struct BST{ 8 int key; 9 BST *lc, *rc;10 BST(){11 ... 阅读全文

posted @ 2015-10-22 16:55 流白阅读(142) 评论(0) 推荐(0) 编辑

流白

公告