2015年7月23日
Best Time to Buy and Sell Stock II
摘要： class Solution {public: int maxProfit(vector& prices) { int sum = 0; int i=0; int n=prices.size(); int min=INT_MAX; while(i... 阅读全文
posted @ 2015-07-23 21:00 *桔子* 阅读(99) 评论(0) 推荐(0)
Best Time to Buy and Sell Stock
摘要： class Solution {public: int maxProfit(vector& prices) {//eg: 5 6 2 3 1 4；// 记录i之前最小的元素； int min = INT_MAX; int pro = 0; ... 阅读全文
posted @ 2015-07-23 19:33 *桔子* 阅读(115) 评论(0) 推荐(0)
Populating Next Right Pointers in Each Node
摘要： /** * Definition for binary tree with next pointer. * struct TreeLinkNode { * int val; * TreeLinkNode *left, *right, *next; * TreeLinkNode(int x) :... 阅读全文
posted @ 2015-07-23 10:32 *桔子* 阅读(150) 评论(0) 推荐(0)
path sum II
摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x... 阅读全文
posted @ 2015-07-23 09:33 *桔子* 阅读(158) 评论(0) 推荐(0)