本文共 628 字,大约阅读时间需要 2 分钟。
class Solution { public int[] productExceptSelf(int[] nums) { if(nums == null || nums.length == 0) { return null; } int len = nums.length; int[] res = new int[len]; int[] L = new int[len]; int[] R = new int[len]; L[0] = 1; for(int i = 1; i < len; i++) { L[i] = L[i - 1] * nums[i - 1]; } R[len - 1] = 1; for(int i = len - 2; i >= 0; i--) { R[i] = R[i + 1] * nums[i + 1]; } for(int i = 0; i < len; i++) { res[i] = L[i] * R[i]; } return res; } }
转载地址:http://oahzi.baihongyu.com/