xiandanqiezi的博客

class Solution {public:    vector twoSum(vector& nums, int target) {        int i=0,j=nums.size()-1;        while (nums[i]+nums[j]!=target) {            if (nums[i]+nums[j]               

二分法查找，数组中有target返回查找到的位置即为插入位置，若数组中没有target，跳出while 循环后返回low即为插入位置。35. Search Insert Positionclass Solution {public:    int searchInsert(vector& nums, int target) {        int high=nums.si

还是dp问题，注意障碍的处理即可class Solution {public:    int uniquePathsWithObstacles(vector>& obstacleGrid) {        int m=obstacleGrid.size(),n=obstacleGrid[0].size();        vector> dp(obstacleGrid.siz

题目描述：Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]思路：...