题解 | #牛群重量积#

#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param nums int整型vector 
     * @return int整型vector
     */
    vector<int> productExceptSelf(vector<int>& nums) {
        // write code here
        int sum = 1;
    
        for(auto num:nums)
            sum *= num;

        vector<int> ans;
        for(int i=0; i<nums.size(); ++i)
        {
            int t_1 = 1, t_3 = 1;
            int t_2 = nums[i];
            if(i-1>=0)
                t_1 = nums[i-1];
            if(i+1<nums.size())
                t_3 = nums[i+1];
            
            ans.emplace_back(sum/(t_1*t_2*t_3));
        }

        return ans;
    }
};