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 productExcludeItself(vector &nums) {
        // write your code here
        vector tmpv;
        for (int i = 0;i