随笔分类 -  leetcode

1 2 下一页
78. Subsets
摘要：Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Exampl 阅读全文
posted @ 2020-02-17 23:46 hyx1 阅读(99) 评论(0) 推荐(0)
75. Sort Colors
摘要：Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the or 阅读全文
posted @ 2020-02-17 23:34 hyx1 阅读(101) 评论(0) 推荐(0)
101. Symmetric Tree
摘要：Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2020-02-17 23:06 hyx1 阅读(89) 评论(0) 推荐(0)
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 阅读全文
posted @ 2020-02-17 22:58 hyx1 阅读(96) 评论(0) 推荐(0)
136. Single Number
摘要：Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runti 阅读全文
posted @ 2020-02-17 22:49 hyx1 阅读(77) 评论(0) 推荐(0)
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 l 阅读全文
posted @ 2020-02-17 22:46 hyx1 阅读(77) 评论(0) 推荐(0)
70. Climbing Stairs
摘要：You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文
posted @ 2020-02-17 22:37 hyx1 阅读(130) 评论(0) 推荐(0)
64. Minimum Path Sum
摘要：Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文
posted @ 2020-02-17 22:34 hyx1 阅读(85) 评论(0) 推荐(0)
62. Unique Paths
摘要：A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文
posted @ 2020-02-17 22:25 hyx1 阅读(141) 评论(0) 推荐(0)
56. Merge Intervals
摘要：Given a collection of intervals, merge all overlapping intervals. Example 1: Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explan 阅读全文
posted @ 2020-02-17 22:22 hyx1 阅读(168) 评论(0) 推荐(0)
55. Jump Game
摘要：Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文
posted @ 2020-02-17 21:51 hyx1 阅读(102) 评论(0) 推荐(0)
53. Maximum Subarray
摘要：Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Inpu 阅读全文
posted @ 2020-02-17 18:43 hyx1 阅读(87) 评论(0) 推荐(0)
42. Trapping Rain Water
摘要：Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. 阅读全文
posted @ 2020-02-17 18:19 hyx1 阅读(109) 评论(0) 推荐(0)
48. Rotate Image
摘要：You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in-place, which 阅读全文
posted @ 2020-02-17 16:32 hyx1 阅读(135) 评论(0) 推荐(0)
49. Group Anagrams
摘要：iven an array of strings, group anagrams together. Example: Input: ["eat", "tea", "tan", "ate", "nat", "bat"], Output: [ ["ate","eat","tea"], ["nat"," 阅读全文
posted @ 2020-02-17 15:55 hyx1 阅读(117) 评论(0) 推荐(0)
41. First Missing Positive
摘要：Given an unsorted integer array, find the smallest missing positive integer. Example 1: Input: [1,2,0] Output: 3 Example 2: Input: [3,4,-1,1] Output: 阅读全文
posted @ 2020-02-16 17:26 hyx1 阅读(90) 评论(0) 推荐(0)
39. Combination Sum
摘要：Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the 阅读全文
posted @ 2020-02-16 00:18 hyx1 阅读(94) 评论(0) 推荐(0)
23. Merge k Sorted Lists
摘要：Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: Input: [ 1->4->5, 1->3->4, 2->6 ] Output: 阅读全文
posted @ 2020-02-15 19:52 hyx1 阅读(90) 评论(0) 推荐(0)
34. Find First and Last Position of Element in Sorted Array
摘要：Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime com 阅读全文
posted @ 2020-02-14 23:12 hyx1 阅读(96) 评论(0) 推荐(0)
33. Search in Rotated Sorted Array
摘要：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Y 阅读全文
posted @ 2020-02-14 22:39 hyx1 阅读(111) 评论(0) 推荐(0)

1 2 下一页