• JAVA:实现DynamicArray动态数组算法(附完整源码)


    JAVA:实现DynamicArray动态数组算法

    package com.thealgorithms.datastructures.dynamicarray;
    
    import java.util.*;
    import java.util.function.Consumer;
    import java.util.stream.Stream;
    import java.util.stream.StreamSupport;
    
    /**
     * This class implements a dynamic array
     *
     * @param  the type that each index of the array will hold
     */
    public class DynamicArray<E> implements Iterable<E> {
    
        private static final int DEFAULT_CAPACITY = 16;
    
        private int capacity;
        private int size;
        private Object[] elements;
    
        /**
         * constructor
         *
         * @param capacity the starting length of the desired array
         */
        public DynamicArray(final int capacity) {
            this.size = 0;
            this.capacity = capacity;
            this.elements = new Object[this.capacity];
        }
    
        /**
         * No-args constructor
         */
        public DynamicArray() {
            this(DEFAULT_CAPACITY);
        }
    
        /**
         * Adds an element to the array If full, creates a copy array twice the size
         * of the current one
         *
         * @param element the element of type  to be added to the array
         */
        public void add(final E element) {
            if (this.size == this.elements.length) {
                this.elements = Arrays.copyOf(this.elements, newCapacity(2 * this.capacity));
            }
    
            this.elements[this.size] = element;
            size++;
        }
    
        /**
         * Places element of type  at the desired index
         *
         * @param index the index for the element to be placed
         * @param element the element to be inserted
         */
        public void put(final int index, E element) {
            this.elements[index] = element;
        }
    
        /**
         * get method for element at a given index returns null if the index is
         * empty
         *
         * @param index the desired index of the element
         * @return  the element at the specified index
         */
        public E get(final int index) {
            return getElement(index);
        }
    
        /**
         * Removes an element from the array
         *
         * @param index the index of the element to be removed
         * @return  the element removed
         */
        public E remove(final int index) {
            final E oldElement = getElement(index);
            fastRemove(this.elements, index);
    
            if (this.capacity > DEFAULT_CAPACITY && size * 4 <= this.capacity) {
                this.elements = Arrays.copyOf(this.elements, newCapacity(this.capacity / 2));
            }
            return oldElement;
        }
    
        /**
         * get method for size field
         *
         * @return int size
         */
        public int getSize() {
            return this.size;
        }
    
        /**
         * isEmpty helper method
         *
         * @return boolean true if the array contains no elements, false otherwise
         */
        public boolean isEmpty() {
            return this.size == 0;
        }
    
        public Stream<E> stream() {
            return StreamSupport.stream(spliterator(), false);
        }
    
        private void fastRemove(final Object[] elements, final int index) {
            final int newSize = this.size - 1;
    
            if (newSize > index) {
                System.arraycopy(elements, index + 1, elements, index, newSize - index);
            }
    
            elements[this.size = newSize] = null;
        }
    
        private E getElement(final int index) {
            return (E) this.elements[index];
        }
    
        private int newCapacity(int capacity) {
            this.capacity = capacity;
            return this.capacity;
        }
    
        /**
         * returns a String representation of this object
         *
         * @return String a String representing the array
         */
        @Override
        public String toString() {
            return Arrays.toString(Arrays.stream(this.elements).filter(Objects::nonNull).toArray());
        }
    
        /**
         * Creates and returns a new Dynamic Array Iterator
         *
         * @return Iterator a Dynamic Array Iterator
         */
        @Override
        public Iterator iterator() {
            return new DynamicArrayIterator();
        }
    
        private class DynamicArrayIterator implements Iterator<E> {
    
            private int cursor;
    
            @Override
            public boolean hasNext() {
                return this.cursor != size;
            }
    
            @Override
            public E next() {
                if (this.cursor > DynamicArray.this.size) {
                    throw new NoSuchElementException();
                }
    
                if (this.cursor > DynamicArray.this.elements.length) {
                    throw new ConcurrentModificationException();
                }
    
                final E element = DynamicArray.this.getElement(this.cursor);
                this.cursor++;
    
                return element;
            }
    
            @Override
            public void remove() {
                if (this.cursor < 0) {
                    throw new IllegalStateException();
                }
    
                DynamicArray.this.remove(this.cursor);
                this.cursor--;
            }
    
            @Override
            public void forEachRemaining(Consumer<? super E> action) {
                Objects.requireNonNull(action);
    
                for (int i = 0; i < DynamicArray.this.size; i++) {
                    action.accept(DynamicArray.this.getElement(i));
                }
            }
        }
    
        /**
         * This class is the driver for the DynamicArray class it tests a variety
         * of methods and prints the output
         */
        public static void main(String[] args) {
            DynamicArray<String> names = new DynamicArray<>();
            names.add("Peubes");
            names.add("Marley");
    
            for (String name : names) {
                System.out.println(name);
            }
    
            names.stream().forEach(System.out::println);
    
            System.out.println(names);
    
            System.out.println(names.getSize());
    
            names.remove(0);
    
            for (String name : names) {
                System.out.println(name);
            }
        }
    }
    
    
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • 10
    • 11
    • 12
    • 13
    • 14
    • 15
    • 16
    • 17
    • 18
    • 19
    • 20
    • 21
    • 22
    • 23
    • 24
    • 25
    • 26
    • 27
    • 28
    • 29
    • 30
    • 31
    • 32
    • 33
    • 34
    • 35
    • 36
    • 37
    • 38
    • 39
    • 40
    • 41
    • 42
    • 43
    • 44
    • 45
    • 46
    • 47
    • 48
    • 49
    • 50
    • 51
    • 52
    • 53
    • 54
    • 55
    • 56
    • 57
    • 58
    • 59
    • 60
    • 61
    • 62
    • 63
    • 64
    • 65
    • 66
    • 67
    • 68
    • 69
    • 70
    • 71
    • 72
    • 73
    • 74
    • 75
    • 76
    • 77
    • 78
    • 79
    • 80
    • 81
    • 82
    • 83
    • 84
    • 85
    • 86
    • 87
    • 88
    • 89
    • 90
    • 91
    • 92
    • 93
    • 94
    • 95
    • 96
    • 97
    • 98
    • 99
    • 100
    • 101
    • 102
    • 103
    • 104
    • 105
    • 106
    • 107
    • 108
    • 109
    • 110
    • 111
    • 112
    • 113
    • 114
    • 115
    • 116
    • 117
    • 118
    • 119
    • 120
    • 121
    • 122
    • 123
    • 124
    • 125
    • 126
    • 127
    • 128
    • 129
    • 130
    • 131
    • 132
    • 133
    • 134
    • 135
    • 136
    • 137
    • 138
    • 139
    • 140
    • 141
    • 142
    • 143
    • 144
    • 145
    • 146
    • 147
    • 148
    • 149
    • 150
    • 151
    • 152
    • 153
    • 154
    • 155
    • 156
    • 157
    • 158
    • 159
    • 160
    • 161
    • 162
    • 163
    • 164
    • 165
    • 166
    • 167
    • 168
    • 169
    • 170
    • 171
    • 172
    • 173
    • 174
    • 175
    • 176
    • 177
    • 178
    • 179
    • 180
    • 181
    • 182
    • 183
    • 184
    • 185
    • 186
    • 187
    • 188
    • 189
    • 190
    • 191
    • 192
    • 193
    • 194
    • 195
    • 196
    • 197
    • 198
    • 199
    • 200
    • 201
    • 202
    • 203
    • 204
    • 205
    • 206
    • 207
    • 208
    • 209
    • 210
    • 211
    • 212
    • 213
    • 214
    • 215
    • 216
    • 217
    • 218
    • 219
    • 220
    • 221
    • 222
    • 223
  • 相关阅读:
    spfa 算法找负环
    stm32 cubeide 闪退 显示self upgrade failed
    R语言柱状图直方图 histogram
    Redis的C客户端(hiredis库)使用
    VLAN 实验
    集合源码学习笔记
    数据源报表
    Python高级篇(08):生成器
    1527. 患某种疾病的患者
    朴素贝叶斯算法
  • 原文地址:https://blog.csdn.net/it_xiangqiang/article/details/126245562