java编程练习题三

题目链接：https://leetcode-cn.com/problems/product-of-array-except-self/

 

 

分析：可以先遍历数组将乘积算出，再将数组逆序排列

class Solution238 {
    public int[] productExceptSelf(int[] nums) {
            int result[] = new int[nums.length];
            int left = 1;
            // 从左往右遍历
            for(int i = 0; i < nums.length; i++){
                result[i] = left;
                left = nums[i] * left;
            }
            int right = 1;
            // 从右往左遍历
            for(int i = nums.length - 1; i >= 0; i--){
                result[i] *= right;
                right = nums[i] * right;
            }
            return result;
    }
}