- 博客(6)
- 收藏
- 关注
RSS订阅原创 作业（十四）——78. Subsets
题目Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3] Output: [ [3], [1], ...
2018-04-28 12:55:42
107
原创 作业（十三）——541. Reverse String II
题目Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of th...
2018-04-25 22:07:35
132
原创 作业（十二）——414. Third Maximum Number
题目Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).Example 1:Input: [3, 2, 1] O...
2018-04-23 18:29:27
162
原创 作业（九）——类的使用
创建和使用类(9.1, 9.2) 类参数默认值设定(9.4) 类的继承（9.6） 类的导入(9.10) 库函数使用（9.14）
2018-04-02 17:30:32
90
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人