摘要：
class Solution {public: int searchInsert(vector& nums, int target) { int left = 0, right = nums.size(), mid = 0; while (lefttarget){... 阅读全文
摘要：
class Solution {public: vector searchRange(vector& nums, int target) { vector result; int tmp = 0; int left = 0, right = nums.size(... 阅读全文
摘要：
class Solution{ public: int search(vector& nums,int target){ int first=0,end=nums.size(); int mid=0; while(first=nums[first]){ i... 阅读全文
摘要：
class Solution {public: vector > permute(vector &num) { vector > result; int n=num.size(); if(n==1) { res... 阅读全文
摘要：
class Solution {public: vector> permute(vector& nums) { vector> result; sort(nums.begin(), nums.end()); do{ result.push_back(nums... 阅读全文
摘要：
class Solution {public: void nextPermutation(vector &num) { int n = num.size(); if (n == 1)return; for (int i = n - 2, ii = n - 1; ... 阅读全文