Tony's Log

摘要： First I thought of a DP solution.. but TLE. So there must be a O(n). I thought of Mono-Queue.. but looks too complex.So what is the naive solution? O(... 阅读全文

摘要： 1A! We get median of each array and compare them, then we know which half should be disguarded and how many should be disguarded.class Solution {publi... 阅读全文

摘要： A classic and representative DP problem. To be revised later. Quite a few interesting details to think about.class Solution {public: int numDistinc... 阅读全文