Permutations(46)

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], an

业界 2016年07月04日

Subsets

Subsets Given a set of distinct integers, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets

业界 2016年07月05日

300. Longest Increasing Subsequence

题目： Given an unsorted array of integers, find the length of longest increasing subsequence. For example, Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7,

业界 2016年07月06日

[Leetcode] Largest Divisible Subset 最大整除集合

Largest Divisible SubsetGiven a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If

业界 2016年07月10日

[Leetcode] First Missing Positive

First Missing PositiveGiven an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n)

业界 2016年07月21日

Sort Solors 解题思路

原文 : https://github.com/kbyyd24/bl...题目先把题目放上：链接：https://leetcode.com/problems...Given an array with n objects colored red, white or blue, sort them so that objects of the same color are

业界 2016年07月28日