Commitb723e86

committed

edit 523

1 parent74feddd commitb723e86Copy full SHA for b723e86

File tree

-0

lines changed

-0

lines changed

Lines changed: 9 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -27,6 +27,15 @@`
`27`	`27`	`*/`
`28`	`28`	`publicclass_523 {`
`29`	`29`
	`30`	`+/**reference: https://discuss.leetcode.com/topic/80793/java-o-n-time-o-k-space/20`
	`31`	`+ *`
	`32`	`+ * "The reason we use modulus is:`
	`33`	`+ * (a+(n*x))%x is same as (a%x)`
	`34`	`+ * e.g. in case of the array [23,2,6,4,7] the running sum is [23,25,31,35,42]`
	`35`	`+ * and the remainders are [5,1,1,5,0].`
	`36`	`+ * We got reminder 5 at index 0 and at index 3.`
	`37`	`+ * That means, in between these two indexes we must have added a number which is multiple of the k.`
	`38`	`+ * Hope this clarifies your doubt :)"*/`
`30`	`39`	`publicbooleancheckSubarraySumOnTimeO1Space(int[]nums,intk) {`
`31`	`40`	`Map<Integer,Integer>map =newHashMap<>();`
`32`	`41`	`map.put(0, -1);`

Comments

(0)