[LeetCode]238. 除自身以为数组的乘积

艾恩凝

个人博客  https://aeneag.xyz/ 

今天第二题，这几天都算简单

https://leetcode-cn.com/problems/product-of-array-except-self/

这道题还算简单，限制时间复杂度就会多想想，上三角下三角，有思路了，就会很容易，最难的就是思路 = = 尴尬

class Solution {
public:
    vector productExceptSelf(vector& nums) {
        int len = nums.size();
        vector res(len,0);
        int left = 1 , right = 1;
        for(int i = 0 ; i < len ; ++i){
            res[i] = left;
            left *= nums[i];
        }
        for(int i = len - 1 ; i > 0 ; --i){
            right *= nums[i];
            res[i-1] *= right;
        }
        return res;
    }
};

只要刷题足够快，每天就可以多刷，