leetcode
文章平均质量分 68
希夏普
这个作者很懒,什么都没留下…
展开
-
Leetcode 104.Maximum Depth of Binary Tree (二叉树的最大深度)
问题描述 Given a binary tree, find its maximum depth. //The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 翻译:给定一棵二叉树,找到它的最大深度 相关概念: (1)原创 2016-10-24 22:29:04 · 429 阅读 · 0 评论 -
Leetcode 204.Count Primes 素性检测
204.Count Primes问题描述 Count the number of prime numbers less than a non-negative number, n. 翻译:计算小于一个非负数n的素数的数量解题思路 (1)最简单的方法–暴力求解 一个函数 countPrimes 算小于非负数n的素数的数量,同时在里面的循环里调用另一个bool型的函数 isPrim原创 2016-10-13 01:14:47 · 445 阅读 · 0 评论 -
Leetcode 121. Best Time to Buy and Sell Stock
问题描述 Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction, design an algorithm to find the maximum profit.原创 2016-10-25 11:10:45 · 334 阅读 · 0 评论 -
Leetcode 122 . Best Time to Buy and Sell Stock II
问题描述 Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like原创 2016-10-25 11:44:34 · 367 阅读 · 0 评论