FilesExpand file tree

 master

/

ProductOfArrayExceptSelf.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

19 lines (17 loc) · 640 Bytes

 master

/

ProductOfArrayExceptSelf.java

Top

File metadata and controls

• Code
• Blame

19 lines (17 loc) · 640 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

// http://www.programcreek.com/2014/07/leetcode-product-of-array-except-self-java/

// I actually met this problem during an interview. However, division was allowed

public class Solution {

public int[] productExceptSelf(int[] nums) {

int[] result = new int[nums.length];

result[result.length-1] = 1;

for (int i = result.length-2; i >= 0; i--) {

result[i] = result[i+1] * nums[i+1];

}

int left = 1;

for (int i = 0; i < result.length; i++) {

result[i] = result[i] * left;

left = left * nums[i];

}

return result;

}

}