FilesExpand file tree

 master

/

productOfArrayExceptSelf.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

48 lines (26 loc) · 1.14 KB

 master

/

productOfArrayExceptSelf.java

Copy path

Top

File metadata and controls

• Code
• Blame

48 lines (26 loc) · 1.14 KB

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

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

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

public class Solution {

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

int n = nums.length;

int[] result = new int[n];

int left = 1;

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

if(i > 0) {

left *= nums[i - 1];

}

result[i] = left;

}

int right = 1;

for(int i = n - 1; i >= 0; i--) {

if(i < n - 1) {

right *= nums[i + 1];

}

result[i] *= right;

}

return result;

}

}