题目三十:
给定一个整数数组A。
定义B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1], 计算B的时候请不要使用除法。
样例
给出A=
[1, 2, 3],返回 B为
[6, 3, 2]
代码:
class Solution {
public:
/*
* @param nums: Given an integers array A
* @return: A long long array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]
*/
vector<long long> productExcludeItself(vector<int> &nums) {
// write your code here
vector<long long> sums;
int size = nums.size()-1;
int i,j;
long long int sum;
for(i=0;i<=size;i++)
{
sum = 1;
for(j=0;j<=size;j++)
{
if(j!=i)
{
sum=sum*nums[j];
}
}
sums.push_back(sum);
}
return sums;
}
};