Leetcode8 Two sum

1、题目描述
Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.
The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

2、解题思路
给定的数组原本是无序的，所以首先使用排序算法进行数组排序，由于最终要求返回的是下标值，所以对数组元素排序的同时，将每个元素对应的下标值进行重新排列；然后在排序后的数组中进行查找；定义两个指针分别指向排序后的数组的首尾元素，两个元素的和大于目标值，第一个指针加一，小于时，第二个指针减一，等于时，对应的下标就是我们的结果。
3、实现代码

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
      auto n=nums.size();
      int  ind[n]={0};
      for(int i=0;i<n;i++)
        ind[i]=i;
      for(int i =0 ; i< n-1; ++i) { 
        for(int j = 0; j < n-i-1; ++j) {  
            if(nums[j] > nums[j+1])  
            {  
                int tmp = nums[j] ; nums[j] = nums[j+1] ;  nums[j+1] = tmp; 
                ind[j]=j+1;
                ind[j+1]=j;
            }  
        }
      }//bubblesort of nums including resorting of index

      int i=0,j=n-1;
      while(i<j){
          int sum=nums[i]+nums[j];
          if(sum<target)
              i++;
          else if(sum>target)
              j--;
          else{
              i=ind[i];
              j=ind[j];
              return i,j;
              break;
          }
      }
      return 0;
    }
};