- 博客(4)
- 收藏
- 关注
RSS订阅原创 二叉树遍历模板（前序，中序，后序）
Pre Order Traversepublic List preorderTraversal(TreeNode root) { List result = new ArrayList<>(); Deque stack = new ArrayDeque<>(); TreeNode p = root; while(!stack.isEmpty() || p !
2017-07-26 05:04:30
626
原创 A clean DP solution which generalizes to k transactions
有一个解决股票买卖问题（Best Time to Buy and Sell Stock）的模板，可以推广到买卖n次。class Solution {public: int maxProfit(vector &prices) { // f[k, ii] represents the max profit up until prices[ii] (Note: NOT en
2017-07-24 13:02:36
285
原创 Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.Have you met t
2017-07-02 01:40:57
306
原创 Subarray Sum Closest
Given an integer array, find a subarray with sum closest to zero. Return the indexes of the first number and last number.Have you met this question in a real interview? YesExample
2017-07-01 02:27:31
359
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人