- 博客(11)
- 收藏
- 关注
RSS订阅原创 268 Missing Number
Missing Number 数组中包含n个0-N不同元素，找到缺失的元素class Solution {public: int missingNumber(vector<int>& nums) { int sum = (1 + nums.size())*nums.size()/2; int s = 0; fo...
2018-04-12 15:54:53
192
原创 219 Contains Duplicate II
Contains Duplicate II 判断数组中是否存在距离小于k的两个相同元素讨论区中一个c++答案：class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_set<int> s; ...
2018-04-12 12:39:00
165
原创 189 Rotate Array
Rotate Array题目要求向右旋转给定数组k次Python代码：class Solution(object): def rotate(self, nums, k): """ :type nums: List[int] :type k: int :rtype: void Do not return anythi...
2018-04-08 16:43:55
346
原创 169 Majority Element
求给定数组中出现次数超过一半的数：https://leetcode.com/problems/majority-element/description/class Solution {public: int majorityElement(vector<int>& nums) { sort(nums.begin(),nums.end()); ...
2018-04-03 21:40:10
195
原创 118, 119Pascal's Triangle
118 Pascal’s Triangle 输出帕斯卡三角：class Solution {public: vector<vector<int>> generate(int numRows) { int n = numRows; vector<vector<int>> p(n); f...
2018-03-23 12:05:30
144
原创 88 Merge Sorted Array
Merge Sorted Array 利用nums1向量的空间将已经排序的nums1和nums2合并并排序。归并排序,一篇比较清晰的文章：https://www.cnblogs.com/DSNFZ/articles/7745785.html我的答案：class Solution {public: void merge(vector<int>& nums1...
2018-03-23 11:37:31
125
原创 66 Plus One
Plus One 将给定数组中各元素看作一个整数的位数，将该整数加一。class Solution {public: vector<int> plusOne(vector<int>& digits) { if (digits.back() < 9){ digits.back() += 1; ...
2018-03-19 10:01:30
178
原创 53 Maximum Subarray
Maximum Subarray一篇动态规划的文章：http://www.hawstein.com/posts/dp-novice-to-advanced.html代码:class Solution {public: int maxSubArray(vector<int>& nums) { int max = nums[0]; ...
2018-03-19 09:56:34
168
原创 35 Search Insert Position
Search Insert Position使用二分法降低时间复杂度class Solution {public: int searchInsert(vector<int>& nums, int target) { int begin = 0, end = nums.size() - 1, mid; while(begin ...
2018-03-14 10:21:15
118
原创 26 Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array使用快慢指针标记重复元素：https://www.cnblogs.com/grandyang/p/4329128.html一个比较简洁的c++解法：int count = 0;for(int i = 1; i < n; i++){ if(A[i] == A[i-1]) count++; e...
2018-03-11 15:30:58
129
原创 1 Two Sum
Two Sum我的答案：class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> v(2,0); for (int i = 0; i < nums.size(); i++){ ...
2018-03-11 09:31:58
124
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人