- 博客(8)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode 368 Largest Divisible Subset
Given 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 there are multiple solution
2016-06-30 11:05:24
250
原创 LeetCode 367 Valid Perfect Square
Given a positive integer num, write a function which returns True if num is a perfect square else False. Note: Do not use any built-in library function such as sqrt. Example 1: Input: 16
2016-06-30 10:44:15
251
原创 LeetCode 357 Count Numbers with Unique Digits
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n. Example: Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x [11,22,33,4
2016-06-27 14:16:42
190
原创 LeetCode 50 Pow(x, n)
Implement pow(x, n). /** * A constant holding the minimum value an {@code int} can * have, -231. */ @Native public static final int MIN_VALUE = 0x80000000; /** * A constant holding the ma
2016-06-23 23:47:00
224
原创 LeetCode 148 Sort List
Sort a linked list in O(n log n) time using constant space complexity. 思路：把链表截成前后两段，对两段链表分别排序，最后再进行合并。 public ListNode sortList(ListNode head) { if (head == null || head.next == null) return
2016-06-06 11:11:03
327
原创 LeetCode 47 Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [ [1,1,2], [1,2,1], [2,1
2016-06-05 03:01:20
216
原创 LeetCode 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], and [3,2,1].
2016-06-01 15:44:54
215
原创 LeetCode 90 Subsets II
Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not contain du
2016-06-01 13:47:35
313
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人