2 problems

Author: hitzzc

Diff for: README.md

@@ -211,6 +211,8 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [284. Peeking Iterator](https://github.com/hitzzc/go-leetcode/tree/master/peeking_iterator)
 #### [287. Find the Duplicate Number](https://github.com/hitzzc/go-leetcode/tree/master/find_the_duplicate_number)
 #### [290. Word Pattern](https://github.com/hitzzc/go-leetcode/tree/master/word_pattern)
+#### [292. Nim Game](https://github.com/hitzzc/go-leetcode/tree/master/nim_game)
+#### [295. Find Median from Data Stream](https://github.com/hitzzc/go-leetcode/tree/master/find_median_from_data_stream)
 
 
 

Diff for: find_median_from_data_stream/find_median_from_data_stream.cpp

@@ -0,0 +1,104 @@
+#include <vector>
+#include <iostream>
+using namespace std;
+
+class Heap {
+private:
+	vector<int> array;
+	int (*compare) (int, int);
+	void adjust(int idx) {
+		int largest = idx;
+		if (2*idx+1 < array.size() && compare(array[2*idx+1], array[idx]))
+			largest = 2*idx+1;
+		if (2*idx+2 < array.size() && compare(array[2*idx+2],array[largest]))
+			largest = 2*idx+2;
+		if (largest != idx) {
+			int tmp = array[idx];
+			array[idx] = array[largest];
+			array[largest] = tmp;
+			adjust(largest);
+		}
+		return;
+	}
+public:
+	Heap(int (*compare) (int, int)): compare(compare) {}
+	void push(int val) {
+		array.push_back(val);
+		for (int i = array.size()/2 - 1; i >= 0; --i){
+			adjust(i);
+		}
+	}
+	void print() {
+		for (auto val: array) 
+			cout << "print\t" << val << endl;
+	}
+	int pop() {
+		int ret = array[0];
+		array[0] = array.back();
+		array.pop_back();
+		adjust(0);
+		return ret;
+	}
+	int empty() {
+		return array.empty();
+	}
+	int size() {
+		return array.size();
+	}
+	int top() {
+		return array[0];
+	}
+};
+
+int max(int i, int j) {
+	if (i > j) return true;
+	return false;
+}
+
+int min(int i, int j) {
+	if (i < j) return true;
+	return false;
+}
+
+class MedianFinder {
+	Heap max_heap;
+	Heap min_heap;
+public:
+	MedianFinder(): max_heap(Heap(max)), min_heap(Heap(min)){}
+    // Adds a number into the data structure.
+    void addNum(int num) {
+        if (max_heap.empty() || num <= max_heap.top()) {
+        	max_heap.push(num);
+        }else {
+        	min_heap.push(num);
+        }
+        if (max_heap.size() > min_heap.size()+1){
+        	int top = max_heap.pop();
+        	min_heap.push(top);
+        }
+        if (min_heap.size() > max_heap.size()) {
+        	int top = min_heap.pop();
+        	max_heap.push(top);
+        }
+        return;
+    }
+
+    // Returns the median of current data stream
+    double findMedian() {
+    	if (max_heap.size() == min_heap.size())
+    		return ((max_heap.top()+min_heap.top())/2.0);
+    	if (max_heap.size() > min_heap.size())
+    		return max_heap.top();
+    	return min_heap.top();
+    }
+};
+
+int main() {
+	MedianFinder finder;
+	finder.addNum(-1);
+	finder.addNum(-2);
+	finder.addNum(-3);
+	finder.addNum(-4);
+	finder.addNum(-5);
+	return 0;
+}

Diff for: nim_game/nim_game.cpp

@@ -0,0 +1,6 @@
+class Solution {
+public:
+    bool canWinNim(int n) {
+       return !(n%4 == 0);
+    }
+};