Commit 7834491

committed

refactoring

1 parent b0c0302 commit 7834491Copy full SHA for 7834491

File tree

+18

-2

lines changed

+18

-2

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -104,7 +104,7 @@ public T peakFirst() {`
`104`	`104`
`105`	`105`	`public void displayList() {`
`106`	`106`	`System.out.print("List (first-->last): ");`
`107`		`- SinglyLink current = head; // start at beginning`
	`107`	`+ SinglyLink<T> current = head; // start at beginning`
`108`	`108`	`while (current != null) // until end of list,`
`109`	`109`	`{`
`110`	`110`	`current.displayLink(); // print data`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,6 +33,7 @@ public class ArrayCircularQueue<T> implements Queue<T>, Iterable<T> {`
`33`	`33`	`// there are another way to calculate front and rear.`
`34`	`34`	`// 1. front = start, rear = start + size`
`35`	`35`	`// 2. to how two pointer, front, rear`
	`36`	`+ // in this implementation, use [inclusive] for both front and rear`
`36`	`37`	`// front`
`37`	`38`	`private int start;`
`38`	`39`	`private int size;`
`@@ -98,6 +99,7 @@ public String toString() {`
`98`	`99`	`return s;`
`99`	`100`	`}`
`100`	`101`
	`102`	`+ @Override`
`101`	`103`	`public Iterator<T> iterator() {`
`102`	`104`	`return new CircularQueueIterator();`
`103`	`105`	`}`

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -234,6 +234,18 @@ public static boolean checkPossibility(int[] arr) {`
`234`	`234`	`* The best solution is to use XOR. XOR of all array elements gives us the number with a single occurrence. The idea is based on the following two facts.`
`235`	`235`	`* a) XOR of a number with itself is 0.`
`236`	`236`	`* b) XOR of a number with 0 is number itself.`
	`237`	`+ *`
	`238`	`+ * Let us consider the above example.`
	`239`	`+ * Let ^ be xor operator as in C and C++.`
	`240`	`+ *`
	`241`	`+ * res = 7 ^ 3 ^ 5 ^ 4 ^ 5 ^ 3 ^ 4`
	`242`	`+ *`
	`243`	`+ * Since XOR is associative and commutative, above`
	`244`	`+ * expression can be written as:`
	`245`	`+ * res = 7 ^ (3 ^ 3) ^ (4 ^ 4) ^ (5 ^ 5)`
	`246`	`+ * = 7 ^ 0 ^ 0 ^ 0`
	`247`	`+ * = 7 ^ 0`
	`248`	`+ * = 7`
`237`	`249`	`*`
`238`	`250`	`* @param array`
`239`	`251`	`* @return`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -38,7 +38,7 @@ public class LinkListAlgorithms {`
`38`	`38`	`@SpaceComplexity("O(1)")`
`39`	`39`	`@Point("Using two Loop")`
`40`	`40`	`@BruteForce`
`41`		`- public static void deleteDuplicatesByRunner(SinglyLink head) {`
	`41`	`+ public static void deleteDuplicates(SinglyLink head) {`
`42`	`42`	`SinglyLink current = head;`
`43`	`43`	`while (current != null) {`
`44`	`44`	`SinglyLink runner = head;`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,8 @@`
`2`	`2`
`3`	`3`	`/**`
`4`	`4`	`* This technique uses the XOR operator to manipulate bits to solve problems.`
	`5`	`+ * a) XOR of a number with itself is 0.`
	`6`	`+ * b) XOR of a number with 0 is number itself.`
`5`	`7`	`*`
`6`	`8`	`* Created by sad.kayvanfar on 6/12/2021.`
`7`	`9`	`*/`

Comments

(0)