摘要: leetcode -Best Time to Buy and Sell Stock IISay you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to... 阅读全文
posted @ 2015-08-18 23:34 cnblogshnj 阅读(101) 评论(0) 推荐(0) 编辑
摘要: leetcode -Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are struct... 阅读全文
posted @ 2015-08-18 23:16 cnblogshnj 阅读(111) 评论(0) 推荐(0) 编辑
摘要: leetcode -Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path fro... 阅读全文
posted @ 2015-08-18 23:10 cnblogshnj 阅读(113) 评论(0) 推荐(0) 编辑
摘要: leetcode -Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from... 阅读全文
posted @ 2015-08-18 17:49 cnblogshnj 阅读(76) 评论(0) 推荐(0) 编辑
摘要: leetcode -Single Number IIGiven an array of integers, every element appearsthreetimes except for one. Find that single one.Note:Your algorithm should ... 阅读全文
posted @ 2015-08-18 16:22 cnblogshnj 阅读(95) 评论(0) 推荐(0) 编辑
摘要: leetcode -Single NumberGiven an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a li... 阅读全文
posted @ 2015-08-18 14:50 cnblogshnj 阅读(100) 评论(0) 推荐(0) 编辑
摘要: Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ... 阅读全文
posted @ 2015-08-18 14:33 cnblogshnj 阅读(119) 评论(0) 推荐(0) 编辑