Commitd04ef97

authored

Merge pull requestneetcode-gh#593 from Basit-Imam/main

Update 238-Product-of-Array-Except-Self.java

2 parents9d051d1 +713492c commitd04ef97Copy full SHA for d04ef97

File tree

+11

-15

lines changed

+11

-15

lines changed

Lines changed: 11 additions & 15 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,24 +1,20 @@`
`1`	`1`	`//Just store the left and right product (Try doing this with extra space first)`
`2`	`2`	`//This one is constant space because we are returning the array we created`
	`3`	`+//In first pass calculate the left product except self and in second calculate the right`
`3`	`4`
`4`	`5`	`classSolution {`
`5`	`6`
`6`	`7`	`publicint[]productExceptSelf(int[]nums) {`
`7`	`8`	`int[]arr =newint[nums.length];`
`8`		`-arr[0] =1;`
`9`		`-for (inti =1;i <nums.length;i++) {`
`10`		`-arr[i] =arr[i -1] *nums[i -1];`
`11`		`- }`
`12`		`-intprod =nums[nums.length -1];`
`13`		`-nums[nums.length -1] =1;`
`14`		`-for (inti =nums.length -2;i >=0;i--) {`
`15`		`-intstore =nums[i];`
`16`		`-nums[i] =nums[i +1] *prod;`
`17`		`-prod =store;`
`18`		`- }`
`19`		`-for (inti =0;i <nums.length;i++) {`
`20`		`-arr[i] =arr[i] *nums[i];`
`21`		`- }`
`22`		`-returnarr;`
	`9`	`+intright=1,left=1;`
	`10`	`+for (inti =0;i <nums.length;i++) {`
	`11`	`+arr[i] =left;`
	`12`	`+left *=nums[i];`
	`13`	`+ }`
	`14`	`+for(inti =nums.length -1;i >=0;i--) {`
	`15`	`+arr[i] *=right;`
	`16`	`+right *=nums[i];`
	`17`	`+ }`
	`18`	`+returnarr;`
`23`	`19`	`}`
`24`	`20`	`}`

Comments

(0)