![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
文章平均质量分 65
asaaaxx
这个作者很懒,什么都没留下…
展开
-
LeetCode- Find Bottom Left Tree Value
题目: Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: 2 / \ 1 3 Output: 1 Example 2: Input: 1 / \ 2 3原创 2017-09-24 11:33:32 · 144 阅读 · 0 评论 -
LeetCode -- Target Sum
题目: You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol. F原创 2017-12-03 18:05:44 · 136 阅读 · 0 评论 -
LeetCode-- Permutations
题目: Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2],原创 2017-12-03 17:25:35 · 157 阅读 · 0 评论 -
LeetCode--Combination Sum||
题目: Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in th原创 2017-12-03 11:35:42 · 184 阅读 · 0 评论 -
LeetCode--Combination Sum
题目: Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may b原创 2017-12-03 11:16:03 · 185 阅读 · 0 评论 -
LeetCode--Binary Tree Level Order Traversal
题目: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 /原创 2017-12-10 13:18:52 · 134 阅读 · 0 评论 -
LeetCode--01 Matrix
题目 Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: Input: 0 0 0 0 1 0 0 0 0 Output: 0 0 0原创 2017-12-09 11:38:06 · 201 阅读 · 0 评论 -
LeetCode -- Search Insert Position
题目: Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the原创 2017-10-14 09:20:20 · 194 阅读 · 0 评论 -
LeetCode--Two Sum
题目描述: Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use原创 2017-09-10 12:22:47 · 183 阅读 · 0 评论 -
LeetCode-
题目: Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits. (Recall that an integer has monotone increasing digits if and only原创 2017-12-13 08:57:28 · 150 阅读 · 0 评论