Commit b0c0302

committed

refactoring

1 parent 27c0e7d commit b0c0302Copy full SHA for b0c0302

File tree

+14

-6

lines changed

+14

-6

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`package ir.sk.adt.datastructure.array;`
`2`	`2`
	`3`	`+import ir.sk.helper.Point;`
`3`	`4`	`import ir.sk.helper.Remainder;`
`4`	`5`
`5`	`6`	`import java.util.Iterator;`
`@@ -15,6 +16,7 @@ public class CircularArray<T> implements Iterable<T> {`
`15`	`16`
`16`	`17`	`private T[] items;`
`17`	`18`
	`19`	`+ @Point("Important part of circular Array compare to normal array is head of array is not always 0")`
`18`	`20`	`// create a member variable head which points to what should be conceptually viewed`
`19`	`21`	`// as the start of the circular array. Rather than shifting around the elements in the array, we just increment`
`20`	`22`	`// head by shift Right.`
`@@ -39,6 +41,9 @@ private int convert(int index) {`
`39`	`41`	`return (head + index) % items.length;`
`40`	`42`	`}`
`41`	`43`
	`44`	`+ /**`
	`45`	`+ * one of the best way for rotation`
	`46`	`+ */`
`42`	`47`	`public void rotate(int shiftRight) {`
`43`	`48`	`head = convert(shiftRight);`
`44`	`49`	`}`

Lines changed: 5 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,7 +30,9 @@ public class ArrayCircularQueue<T> implements Queue<T>, Iterable<T> {`
`30`	`30`	`private T[] items;`
`31`	`31`	`private int capacity;`
`32`	`32`
`33`		`- // there are another way to calculate front and rear. 1.front = start, rear = start + size`
	`33`	`+ // there are another way to calculate front and rear.`
	`34`	`+ // 1. front = start, rear = start + size`
	`35`	`+ // 2. to how two pointer, front, rear`
`34`	`36`	`// front`
`35`	`37`	`private int start;`
`36`	`38`	`private int size;`
`@@ -69,7 +71,7 @@ public void enqueue(T item) {`
`69`	`71`	`throw new UnsupportedOperationException("Queue is full");`
`70`	`72`	`}`
`71`	`73`	`// calculate rear`
`72`		`- items[(start + size) % capacity] = item;`
	`74`	`+ items[(start + size) % capacity] = item;// or if (start + size == capacity) start = 0`
`73`	`75`	`size++;`
`74`	`76`	`}`
`75`	`77`
`@@ -85,7 +87,7 @@ public T dequeue() {`
`85`	`87`
`86`	`88`	`@Override`
`87`	`89`	`public T peek() {`
`88`		`- returnnull;`
	`90`	`+ thrownewUnsupportedOperationException("Not implemented");`
`89`	`91`	`}`
`90`	`92`
`91`	`93`	`public String toString() {`

Lines changed: 4 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -53,8 +53,9 @@ public static void leftShift(int[] array, int startIndex, int endIndex, int unit`
`53`	`53`	`array[i] = array[i + unit];`
`54`	`54`	`}`
`55`	`55`
	`56`	`+ // another way of rotation is Circular Array`
`56`	`57`	`/**`
`57`		`- * shifting - left rotation just one unit`
	`58`	`+ * rotation - left rotation just one unit`
`58`	`59`	`*`
`59`	`60`	`* @param array the source array.`
`60`	`61`	`* @param startIndex starting position`
`@@ -69,7 +70,7 @@ public static void leftRotate(int[] array, int startIndex, int endIndex) {`
`69`	`70`	`}`
`70`	`71`
`71`	`72`	`/**`
`72`		`- * shifting - right rotation unit number`
	`73`	`+ * rotation - right rotation unit number`
`73`	`74`	`*`
`74`	`75`	`* @param array the source array.`
`75`	`76`	`* @param startEndex starting position`
`@@ -98,7 +99,7 @@ public static void rightRotate(int[] array, int startEndex, int endIndex, int un`
`98`	`99`	`}`
`99`	`100`
`100`	`101`	`/**`
`101`		`- * shifting - left rotation unit number`
	`102`	`+ * rotation - left rotation unit number`
`102`	`103`	`*`
`103`	`104`	`* @param array the source array.`
`104`	`105`	`* @param startIndex starting position`

Comments

(0)