原创 464 Can I Win

464 Can I Win 題目描述:In the “100 game,” two players take turns adding, to a running total, any integer from 1..10. T

原创 523. Continuous Subarray Sum

523. Continuous Subarray Sum 題目描述:Given a list of non-negative numbers and a target integer k, write a function to

原创 343. Integer Break

343. Integer Break 題目描述:Given a positive integer n, break it into the sum of at least two positive integers and ma

原创 309. Best Time to Buy and Sell Stock with Cooldown

309. Best Time to Buy and Sell Stock with Cooldown 題目描述:Say you have an array for which the i*th element is the pr

原创 416. Partition Equal Subset Sum

416. Partition Equal Subset Sum 題目描述:Given a non-empty array containing only positive integers, find if the array

原创 375. Guess Number Higher or Lower II

375. Guess Number Higher or Lower II 題目描述:We are playing the Guess Game. The game is as follows: I pick a number f

原创 638. Shopping Offers

638. Shopping Offers 題目描述:In LeetCode Store, there are some kinds of items to sell. Each item has a price. However

原创 300. Longest Increasing Subsequence

300. Longest Increasing Subsequence 題目描述:Given an unsorted array of integers, find the length of longest increasin

原创 413 Arithmetic Slices

413 Arithmetic Slices 題目描述:A sequence of number is called arithmetic if it consists of at least three elements and

原创 377. Combination Sum IV

377. Combination Sum IV 題目描述:Given an integer array with all positive numbers and no duplicates, find the number o

原创 368. Largest Divisible Subset

368. Largest Divisible Subset 題目描述:Given a set of distinct positive integers, find the largest subset such that ev

原创 304.Range Sum Query 2D - Immutable

304.Range Sum Query 2D - Immutable 題目描述:Given a 2D matrix matrix, find the sum of the elements inside the rectangl

原创 322. Coin Change

322. Coin Change 題目描述:You are given coins of different denominations and a total amount of money amount. Write a f

原创 392. Is Subsequence

392. Is Subsequence 題目描述:Given a string s and a string t, check if s is subsequence of t. You may assume that ther

原创 338. Counting Bits

338. Counting Bits 題目描述:Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calc