update comments

kittolin · Apr 12, 2020 · d4c5a0c · d4c5a0c
1 parent 0e9f0ef
commit d4c5a0c
Show file tree

Hide file tree

Showing 2 changed files with 20 additions and 20 deletions.
diff --git a/src/array/DynamicArray.java b/src/array/DynamicArray.java
@@ -53,7 +53,7 @@ public String toString() {
     }
 
     /**
-     * 动态扩缩容
+     * Expand or shrinkage capacity dynamically
      */
     private void resize(int newCapacity) {
         if(newCapacity <= size) {
@@ -69,7 +69,7 @@ private void resize(int newCapacity) {
     }
 
     /**
-     * O(n)
+     * Time complexity: O(n)
      */
     public void add(int index, E e) {
         if(index < 0 || index > size) {
@@ -89,22 +89,22 @@ public void add(int index, E e) {
     }
 
     /**
-     * O(n)
+     * Time complexity: O(n)
      */
     public void addFirst(E e) {
         add(0, e);
     }
 
     /**
-     * amortized time complexity: O(1)
+     * Amortized time complexity: O(1)
      */
     public void addLast(E e) {
         add(size, e);
     }
 
     /**
      * @author: Kitto
-     * O(n)
+     * Time complexity: O(n)
      */
     public void add(E[] arr) {
         if(arr == null) {
@@ -123,7 +123,7 @@ public void add(E[] arr) {
     }
 
     /**
-     * O(1)
+     * Time complexity: O(1)
      */
     public void set(int index, E e) {
         if(index < 0 || index >= size) {
@@ -133,7 +133,7 @@ public void set(int index, E e) {
     }
 
     /**
-     * O(1)
+     * Time complexity: O(1)
      */
     public E get(int index) {
         if(index < 0 || index >= size) {
@@ -143,21 +143,21 @@ public E get(int index) {
     }
 
     /**
-     * O(1)
+     * Time complexity: O(1)
      */
     public E getFirst() {
         return get(0);
     }
 
     /**
-     * O(1)
+     * Time complexity: O(1)
      */
     public E getLast() {
         return get(size - 1);
     }
 
     /**
-     * O(n)
+     * Time complexity: O(n)
      */
     public int find(E e) {
         for(int i = 0; i < size; i++) {
@@ -170,7 +170,7 @@ public int find(E e) {
 
     /**
      * @author: Kitto
-     * O(n)
+     * Time complexity: O(n)
      */
     public int[] findAll(E e) {
         ArrayList<Integer> list = new ArrayList<>();
@@ -188,14 +188,14 @@ public int[] findAll(E e) {
     }
 
     /**
-     * O(n)
+     * Time complexity: O(n)
      */
     public boolean contains(E e) {
         return find(e) != -1;
     }
 
     /**
-     * O(n)
+     * Time complexity: O(n)
      */
     public E remove(int index) {
         if(index < 0 || index >= size) {
@@ -219,21 +219,21 @@ public E remove(int index) {
     }
 
     /**
-     * O(n)
+     * Time complexity: O(n)
      */
     public E removeFirst() {
         return remove(0);
     }
 
     /**
-     * amortized time complexity: O(1)
+     * Amortized time complexity: O(1)
      */
     public E removeLast() {
         return remove(size - 1);
     }
 
     /**
-     * O(n)
+     * Time complexity: O(n)
      */
     public int removeElement(E e) {
         int index = find(e);
@@ -245,7 +245,7 @@ public int removeElement(E e) {
 
     /**
      * @author: Kitto
-     * O(n²) FIXME The indexes have changed after remove the first matched element.
+     * Time complexity: O(n²) FIXME The indexes have changed after remove the first matched element.
      */
     public int[] removeAllElements(E e) {
         int[] indexes = findAll(e);

diff --git a/src/stack/ArrayStack.java b/src/stack/ArrayStack.java
@@ -31,15 +31,15 @@ public boolean isEmpty() {
     }
 
     /**
-     * amortized time complexity: O(1)
+     * Amortized time complexity: O(1)
      */
     @Override
     public void push(E e) {
         arr.addLast(e);
     }
 
     /**
-     * amortized time complexity: O(1)
+     * Amortized time complexity: O(1)
      */
     @Override
     public E pop() {
@@ -50,7 +50,7 @@ public E pop() {
     }
 
     /**
-     * O(1)
+     * Time complexity: O(1)
      */
     @Override
     public E peek() {