LintCode-剑指Offer-(50)数组剔除元素后的乘积

class Solution {
public:
    /**
    * @param A: 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 > tmpv;
        for (int i = 0;i<nums.size();i++){
            long long tmp = 1;
            for (int j = 0;j<nums.size();j++){
                if (j!=i){
                    tmp *= nums[j];
                }
            }
            tmpv.push_back(tmp);
        }
        return tmpv;
    }
};