题目说明,不能使用除法,没有思路。
答案一:超时,因为left、right和result一开始没有设置数组大小,存取浪费时间。
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int ans = 1;
vector<int> left;
left.push_back(ans);
for (int i = 1; i < nums.size(); i++) {
ans *= nums[i-1];
left.push_back(ans);
}
print(left);
vector<int> right;
ans = 1;
right.insert(right.begin(), ans);
for (int i = nums.size() - 2; i >= 0; i--) {
ans *= nums[i+1];
right.insert(right.begin(), ans);
}
print(right);
vector<int> result;
for (int i = 0; i < left.size(); i++) {
result.push_back(left[i] * right[i]);
}
return result;
}
};
方案二:left和right在一开始定义其大小,以后每次存取数据可以节省时间
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int ans = 1;
vector<int> left(nums.size(), 0), right(nums.size(), 0);
left[0] = ans;
for (int i = 1; i < nums.size(); i++) {
ans *= nums[i-1];
left[i] = ans;
}
ans = 1;
right[nums.size()-1] = ans;
for (int i = nums.size() - 2; i >= 0; i--) {
ans *= nums[i+1];
right[i] = ans;
}
vector<int> result(nums.size(), 0);
for (int i = 0; i < left.size(); i++) {
result[i] = left[i] * right[i];
}
return result;
}
};