238. Product of Array Except Self java solutions

标签：

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

Follow up:
Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)

 1 public class Solution {
 2     public int[] productExceptSelf(int[] nums) {
 3         int[] ans = new int[nums.length];
 4         for(int i = 0,tmp = 1;i < nums.length; i++){
 5             ans[i] = tmp;
 6             tmp *= nums[i];
 7         }
 8         for(int i = nums.length - 1,tmp = 1;i >= 0; i--){
 9             ans[i] *= tmp;
10             tmp *= nums[i];
11         }
12         return ans;
13     }
14 }

238. Product of Array Except Self java solutions

标签：

原文地址：http://www.cnblogs.com/guoguolan/p/5603425.html