对撞指针练习题leetcode167/125/344/345/11

//167 在有序数组中寻找值为target的两个值的位置（索引+1）
vector twoSum(vector& numbers, int target) {
    int i = 0,j=numbers.size()-1;//刚开始我把j=numbers.size()，导致错误
    vector result;
    while(i twoSum2(vector& numbers, int target) {
 int length=numbers.size();
 int i = 0;
 int mid=0;
 for(i; i< length;i++){
     int num2=target-numbers[i];
     int l=i+1,r=length-1;//刚开始我把l=i；导致错误
     while(l<=r){
  mid = l + (r-l)/2;
  if( numbers[mid] == num2 ){
 //刚开始我这里写的是break，把下面四行写在了while外面，报错
      vector vec;
      vec.push_back(i+1);
      vec.push_back(mid+1);
      return vec;
  }
  if( numbers[mid] < num2 )
      l = mid + 1;
  else
      r = mid - 1;
     }

 }

    }

    //125. Valid Palindrome
    //只看数字和字母，忽略大小写的情况下，检查是否回文
    //c++ string类中 isalnum,toupper太好用啦
    bool isPalindrome(string s) {
 int i=0;
 int j=s.size()-1;
 for(;i& height) {
    int i=0;
    int j=height.size()-1;
    int area=0;
    while(i