Code练习
凌凌岛
这个作者很懒,什么都没留下…
展开
-
LeetCode-112:Path Sum(路径总和)
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Note: A leaf is a node with no children.Example:Given the below binary tree and sum = 22, 5 /原创 2020-07-08 00:17:06 · 178 阅读 · 0 评论 -
LeetCode-739:Daily Temperatures(每日温度)
Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.For example, given the原创 2020-06-11 12:54:34 · 200 阅读 · 0 评论 -
LeetCode-面试题64:求1+2+…+n
求 1+2+…+n ,要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句(A?B:C)。示例 1:输入: n = 3输出: 6示例 2:输入: n = 9输出: 45限制:1 <= n <= 10000思路短路加递归实现Java实现class Solution { public int sumNums(int n) { boolean flag = n > 0 && (n原创 2020-06-02 22:42:23 · 169 阅读 · 0 评论 -
LeetCode-1431:Kids With the Greatest Number of Candies(拥有最多糖果的孩子)
Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has.For each kid check if there is a way to distribute extraCandies among the kids such that he or she can have the greatest number of原创 2020-06-01 13:55:48 · 338 阅读 · 0 评论 -
最大子列和问题
给定K个整数组成的序列{ N1 , N2 , … , NK },“连续子列”被定义为{ Ni , Ni+1 , …, Nj },其中1≤i≤j≤K。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定序列{ -2, 11, -4, 13, -5, -2 },其连续子列{ 11, -4, 13 }有最大的和20。现要求你编写程序,计算给定整数序列的最大子列和。输入格式:输入第1行...原创 2020-05-05 23:01:12 · 459 阅读 · 0 评论