摘要：
A variation to 0-1 Knapsack. (No Python code got fully AC. Python is too slow for this problem) #include <cmath> #include <cstdio> #include <vector> # 阅读全文
posted @ 2016-02-03 14:32
Tonix
阅读(414)
评论(0)
推荐(0)
摘要：
https://leetcode.com/discuss/77133/o-n-o-1-after-median-virtual-indexing Please note the "interleaved" version of partial.. nice idea.. 阅读全文
posted @ 2016-02-03 12:36
Tonix
阅读(125)
评论(0)
推荐(0)
摘要：
Yes a typical stack based problem. Please take care of corner cases. class Solution { public: bool isValidSerialization(string preorder) { // Get toke 阅读全文
posted @ 2016-02-03 06:08
Tonix
阅读(260)
评论(0)
推荐(0)
浙公网安备 33010602011771号