update

fluency03 · fluency03 · commit c5330eac2f90 · 2018-10-23T22:02:16.000+02:00
diff --git a/src/data-structures/BinaryIndexedTree.java b/src/data-structures/BinaryIndexedTree.java
@@ -21,15 +21,15 @@ private void constructBIT(int[] nums) {
     }
 
     public void update(int i, int delta) {
-        int k = i;
+        int k = i + 1;
         while (k <= this.N) {
             this.tree[k] += delta;
             k += lowBit(k);
         }
     }
 
     public int query(int i) {
-        int k = i;
+        int k = i + 1;
         int res = 0;
         while (k > 0) {
             res += this.tree[k];

Original file line number	Diff line number	Diff line change
`@@ -21,15 +21,15 @@ private void constructBIT(int[] nums) {`
`21`	`21`	`}`
`22`	`22`
`23`	`23`	`public void update(int i, int delta) {`
`24`		`- int k = i;`
	`24`	`+ int k = i + 1;`
`25`	`25`	`while (k <= this.N) {`
`26`	`26`	`this.tree[k] += delta;`
`27`	`27`	`k += lowBit(k);`
`28`	`28`	`}`
`29`	`29`	`}`
`30`	`30`
`31`	`31`	`public int query(int i) {`
`32`		`- int k = i;`
	`32`	`+ int k = i + 1;`
`33`	`33`	`int res = 0;`
`34`	`34`	`while (k > 0) {`
`35`	`35`	`res += this.tree[k];`