摘要：
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. 阅读全文
posted @ 2019-10-30 10:36
Schwifty
阅读(143)
评论(0)
推荐(0)
摘要：
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. Example 1: Input: n = 12 O 阅读全文
posted @ 2019-10-30 04:56
Schwifty
阅读(164)
评论(0)
推荐(0)
摘要：
Shuffle a set of numbers without duplicates. Example: // Init an array with set 1, 2, and 3. int[] nums = {1,2,3}; Solution solution = new Solution(nu 阅读全文
posted @ 2019-10-30 04:09
Schwifty
阅读(146)
评论(0)
推荐(0)
浙公网安备 33010602011771号