思路:
可以很轻松的想到,假设两数a,b有以下两种方法。
a = a + b;
b = a - b;
a = a - b;
或者
a = a - b;
b = a + b;
a = -1 * (a - b);
这题主要考点是不要超出int界限,所以根据正负不同灵活选择。
class Solution {
public:
vector<int> swapNumbers(vector<int>& numbers) {
if((numbers[0] >= 0 && numbers[1] >= 0) || (numbers[0] <= 0 && numbers[1] <= 0)){
numbers[0] = numbers[0] - numbers[1];
numbers[1] += numbers[0];
numbers[0] = -1 * (numbers[0] - numbers[1]);
}else{
numbers[0] = numbers[0] + numbers[1];
numbers[1] = numbers[0] - numbers[1];
numbers[0] -= numbers[1];
}
return numbers;
}
};