力扣-数组题

1. 两数之和

���出map中是否有target-nums[i]，

class Solution {public:    vector twoSum(vector& nums, int target) {        unordered_map hash;        for(int i = 0 ;i  
26. 删除有序数组中的重复项
 
使用双指针 
 
class Solution {public:    int removeDuplicates(vector& nums) {        int left = 0;        int right = 1;        while(right  
27. 移除元素
 
双指针
 
class Solution {public:    int removeElement(vector& nums, int val) {        int lowIndex =0;        for(int fastIndex = 0; fastIndex  
66. 加一
 
我写的，能过一半用例，笨方法。只是想确定一下笨方法可不可行，不管笨不笨，能拿到分就是好方法。class Solution {public:    vector plusOne(vector& digits) {        stack stack;        vector res;        uint num = 0;        uint cont = 1;        for(int i = digits.size()-1;i >= 0;i--)        {            num += digits[i]*cont;            cont *= 10;        }        cout