Ke Xu kanrourou

kanrourou / Find Median from Data Stream_2.cpp

Created January 22, 2019 01:12

	class MedianFinder {
	public:
	/** initialize your data structure here. */
	MedianFinder() {

	}

	void addNum(int num) {
	if(maxPQ.empty() \|\| num <= maxPQ.top())
	maxPQ.push(num);

kanrourou / Find Median from Data Stream.cpp

Created January 22, 2019 01:10

	class MedianFinder {
	public:
	/** initialize your data structure here. */
	MedianFinder() {

	}

	void addNum(int num) {
	if(set.empty())
	{

kanrourou / Meeting Rooms II.cpp

Created January 21, 2019 05:54

	/**
	* Definition for an interval.
	* struct Interval {
	* int start;
	* int end;
	* Interval() : start(0), end(0) {}
	* Interval(int s, int e) : start(s), end(e) {}
	* };
	*/
	class Solution {

kanrourou / K Empty Slots_2.cpp

Created January 20, 2019 02:38

	class Solution {
	public:
	int kEmptySlots(vector<int>& flowers, int k) {
	int len = flowers.size();
	set<int> bloom;
	for(int i = 0; i < len; ++i)
	{
	int pos = flowers[i];
	auto iter = bloom.insert(pos).first;
	if(iter != bloom.begin())

kanrourou / K Empty Slots_1.cpp

Created January 20, 2019 02:32

	class Solution {
	public:
	int kEmptySlots(vector<int>& flowers, int k) {
	int n = flowers.size();
	//days[i] represent the day when flower at i blooms
	vector<int> days(n, -1);
	for(int i = 0; i < n; ++i)
	{
	int idx = flowers[i];
	days[idx - 1] = i + 1;

kanrourou / Minimum Area Rectangle II_2.cpp

Created January 20, 2019 01:24

kanrourou / Minimum Area Rectangle II_1.cpp

Last active January 20, 2019 00:59

kanrourou / Encode and Decode TinyURL.cpp

Created January 2, 2019 06:19

	class Solution {
	public:

	// Encodes a URL to a shortened URL.
	string encode(string longUrl) {
	int base = 62, id = _id++;
	string res = "";
	while(id)
	{
	int digit = id % base;

kanrourou / really_simple_web_crawler.py

Created December 31, 2018 23:12

	import urllib2

	def get_all_links(page):
	#extract all links from the html page

	def get_page(link):
	#get the html page


	def addTasks(tasks, newTasks):

kanrourou / Design Search Autocomplete System.cpp

Last active December 31, 2018 21:17

	struct Node
	{
	vector<pair<int, string>> sentences;
	unordered_map<char, Node*> children;
	};

	class AutocompleteSystem {
	public:
	AutocompleteSystem(vector<string> sentences, vector<int> times) {
	root = new Node();