Leetcode2 the Sum ii–input array is sorted

Both Sum ii–input array is sorted

[Email protected]

Question:

Similar to Question [1. Both Sum], except that the input array was already sorted in

Ascending order.

The same question: first sort, then from the beginning and the end of the same time to look in the middle, the principle is relatively simple. O (Nlogn) runtime, O (1) space

Vector<int> twosumsored (vector<int>& nums, int target) {

Vector<int> veccopy (nums);

int i=0,n=2,l=0,r = Nums.size ()-1;

Sort (Veccopy.begin (), Veccopy.end ());

int J=nums.size ()-1;

while (I<J)

{

int sum = Nums[i]+nums[j];

if (sum <target)

{

i++;

}

else if (Sum > Target)

{

j--;

}

Else

{

Vector<int> index;

Index.push_back (i+1);

Index.push_back (j+1);

return index;

}

}

}

Leetcode2 the Sum ii–input array is sorted