chenxy258的博客

LeetCode 2.Add Two Numbers

416. Partition Equal Subset Sum Description Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both sub

746. Min Cost Climbing Stairs Description On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. You ne

70. Climbing Stairs Description 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 climb to the top?

198. House Robber Description You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing eac

121. Best Time to Buy and Sell Stock Description 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 transacti

698. Partition to K Equal Sum Subsets Description Given an array of integers nums and a positive integer k, find whether it’s possible to divide this array into k non-empty subsets whose sums are al

112. Path Sum Description 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. Example Given the bel

257. Binary Tree Paths Description Given a binary tree, return all root-to-leaf paths. Example For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths

26. Remove Duplicates from Sorted Array Description Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length. Do not allocate extra spa

80. Remove Duplicates from Sorted Array II Description Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice? Example For example, Given sorted array nums = [1,1,1,

744. Find Smallest Letter Greater Than Target Description Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in

349. Intersection of Two Arrays Description Given two arrays, write a function to compute their intersection. Example Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i

455.Assign CookiesDescriptionAssume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which

Leetcode 122.Best Time to Buy and Sell Stock IIDescriptionSay 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 ma

LeetCode 1.Two Sum

55.Jump GameDescriptionGiven an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that pos

45.Jump Game IIDescriptionGiven an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that

7.Reverse IntegerDescriptionReverse digits of an integer. Note: The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows. ExampleExample1:

435. Non-overlapping IntervalsDescriptionGiven a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Note: 1.You may assu

452.Minimum Number of Arrows to Burst BalloonsDescriptionThere are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of t

738. Monotone Increasing Digits Description 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 mo

53. Maximum Subarray Description Find the contiguous subarray within an array (containing at least one number) which has the largest sum. Example For example, given the array [-2,1,-3,4,-1,2,1,-