zoukankan      html  css  js  c++  java
  • 238. Product of Array Except Self

    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.)

    Similar: 152. Maximum Product Subarray

    42. Trapping Rain Water

     1 public class Solution {
     2     public int[] productExceptSelf(int[] nums) {
     3         int[] output = new int[nums.length];
     4         
     5         output[0] = 1;
     6         for (int i = 1; i < nums.length; i++) {
     7             output[i] = output[i-1] * nums[i-1];
     8         }
     9         
    10         int right = 1;
    11         for (int i = nums.length-1; i>=0; i--) {
    12             output[i] *= right;
    13             right *= nums[i];
    14         }
    15         
    16         return output;
    17     }
    18 }
  • 相关阅读:
    Ajax返回DataSet时
    spring(8)
    spring(12)
    spring(6)
    spring(11)
    spring(10)
    spring(5)
    spring(3)
    spring(9)
    spring(7)
  • 原文地址:https://www.cnblogs.com/joycelee/p/5400224.html
Copyright © 2011-2022 走看看