leetcode 简单题
sunsiemngkira
这个作者很懒,什么都没留下…
展开
-
leetcode-Best Time to Buy and Sell Stock I II
public class Solution { public int maxProfit(int[] prices) { int x; int profit=0; for(x=0;x int p = prices[x+1]-prices[x]; if (p>0){原创 2014-04-04 13:20:03 · 520 阅读 · 0 评论 -
leetcode 简单题 Maximum Depth of Binary Tree and so on
Maximum Depth of Binary Tree Total Accepted: 13959 Total Submissions: 32009My Submissions Given a binary tree, find its maximum depth. The maximum depth is the number of nodes alon原创 2014-04-03 22:41:06 · 517 阅读 · 0 评论