![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
文章平均质量分 65
我就是多啦a梦
这个作者很懒,什么都没留下…
展开
-
[LeetCode 293] Flip Game
You are playing the following Flip Game with your friend: Given a string that contains only these two characters:+and -, you and your friend take turns to flip two consecutive "++" into "--". The ga原创 2016-02-24 11:56:12 · 387 阅读 · 0 评论 -
二分查找
//递归版二分查找 int binarySearch(vector& nums,int left,int right,int target){ if(nums.empty()) return -1; int mid=0; while(left<right){ mid=(left+right)/2; if(nums[mid]==target)原创 2016-09-01 10:46:57 · 266 阅读 · 0 评论 -
Combination Sum
class Solution { private: vector c; vector > res; //保存最后结果 public: vector > combinationSum(vector &candidates, int target) { vector a; sort(candidates.begin(), candidates.end()); //先对C中候选数升序排序原创 2016-08-31 15:15:08 · 276 阅读 · 0 评论 -
Search Insert Position
class Solution { public: int searchInsert(vector& nums, int target) { int left = 0, right = nums.size(), mid = 0; while (left<right){ mid = (left + right) / 2; if (nums[mid] == target){原创 2016-08-30 20:15:53 · 294 阅读 · 0 评论 -
Search for a Range
class Solution { public: vector searchRange(vector& nums, int target) { vector result; int tmp = 0; int left = 0, right = nums.size(), mid = 0; //if (left == right) return nums[0] == target ?原创 2016-08-30 19:53:46 · 273 阅读 · 0 评论 -
Search in Rotated Sorted Array
class Solution{ public: int search(vector& nums,int target){ int first=0,end=nums.size()-1; int mid=0; while(first<=end){ mid=(first+end)/2; if(nums[mid]==target) return mid; if(nu原创 2016-08-30 16:52:39 · 266 阅读 · 0 评论 -
permutation递归方法
class Solution { public: vector > permute(vector &num) { vector > result; int n=num.size(); if(n==1) { result.push_back(num); return result; }原创 2016-08-30 11:33:31 · 395 阅读 · 0 评论 -
Permutations
class Solution { public: vector> permute(vector& nums) { vector> result; sort(nums.begin(), nums.end()); do{ result.push_back(nums); } while (next_permutation(nums.begin(), nums.end()));原创 2016-08-30 11:08:37 · 341 阅读 · 0 评论 -
next permutation
class Solution { public: void nextPermutation(vector &num) { int n = num.size(); if (n == 1)return; for (int i = n - 2, ii = n - 1; i >= 0; i--, ii--) if (num[i] < num[ii]) { int j = n -原创 2016-08-30 08:56:05 · 311 阅读 · 0 评论 -
4Sum
class Solution { public: vector > fourSum(vector &num,int target) { int n = num.size(); sort(num.begin(), num.end()); vector > res; i原创 2016-08-29 16:03:14 · 351 阅读 · 0 评论 -
3Sum Closest
class Solution { public: int threeSumClosest(vector& nums, int target) { int result = nums[0] + nums[1] + nums[2]; int gap = abs(result - target); //if(nums.size()<3) return result; sort(nums原创 2016-08-29 15:45:50 · 354 阅读 · 0 评论 -
3-sum leetcode经典解答
class Solution { public: vector > threeSum(vector &num) { int n = num.size(); sort(num.begin(), num.end()); vector > res; for(int i = 0; i < n-2; i++)原创 2016-08-29 11:15:48 · 524 阅读 · 0 评论 -
2sum问题经典解答
bool compare(pair lh, pair rh) { return lh.first < rh.first; } class Solution { public: vector twoSum(vector &numbers, int target) { vector > num; int index = 1; for(vector::iterato原创 2016-08-29 09:44:50 · 424 阅读 · 0 评论