- 博客(9)
- 收藏
- 关注
原创 Leetcode 343. Integer Break
题目链接问题描述Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2,...
2018-05-16 14:00:41 130
原创 Leetcode 357. Count Numbers with Unique Digits
题目链接问题描述Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x <...
2018-05-16 13:34:52 179
原创 Leetcode 47. Permutations II
题目链接问题描述Given a collection of numbers that might contain duplicates, return all possible unique permutations.Example:Input: [1,1,2] Output: [ [1,1,2], [1,2,1], [2,1,1] ]解题思路与Leetcode 46类似,求一个数组的...
2018-05-14 15:01:17 183
原创 Leetcode 46. Permutations
题目链接问题描述Given a collection of distinct integers, return all possible permutations.Example:Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1] ]解题思路这是求一个数组的全排列。使用D...
2018-05-12 12:56:14 142
原创 Leetcode 40. Combination Sum II
题目链接问题描述Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.Each number in candidat...
2018-05-11 13:55:49 155
原创 Leetcode 39. Combination Sum
题目链接问题描述Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.The same ...
2018-05-10 21:18:08 143
原创 Leetcode 34. Search for a Range
题目链接问题描述Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If...
2018-05-08 16:31:56 213
原创 系统分析与设计 Homework 6
1)使用 UML State Model建模对象: 参考 Asg_RH 文档, 对 Reservation/Order 对象建模。建模要求: 参考练习不能提供足够信息帮助你对订单对象建模,请参考现在 定旅馆 的旅游网站,尽可能分析围绕订单发生的各种情况,直到订单通过销售事件(柜台销售)结束订单。2)研究淘宝退货流程活动图,对退货业务对象状态建模...
2018-05-04 16:23:34 155
原创 Leetcode 33. Search in Rotated Sorted Array
题目链接问题描述Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).You are given a target value to search. If fo...
2018-05-03 10:55:19 125
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人