{"id":587,"date":"2022-01-09T12:50:07","date_gmt":"2022-01-09T04:50:07","guid":{"rendered":"https:\/\/bigwer.cn\/?p=587"},"modified":"2022-03-10T13:53:49","modified_gmt":"2022-03-10T05:53:49","slug":"jdk1-8-list","status":"publish","type":"post","link":"https:\/\/bigwer.cn\/index.php\/2022\/01\/09\/jdk1-8-list\/","title":{"rendered":"JDK1.8-List"},"content":{"rendered":"

<\/div><\/p>\n

\u4e00.ArrayList<\/h3>\n

1.\u6570\u636e\u7ed3\u6784<\/h4>\n

ArrayList\u5e95\u5c42\u6570\u636e\u7ed3\u6784\u662f\u4e00\u4e2aObject[]\u6570\u7ec4\uff0c\u5e95\u5c42\u6570\u7ec4\u7684\u9ed8\u8ba4\u521d\u59cb\u5316\u5bb9\u91cf\u4e3a10\u3002<\/p>\n

    \/\/ \u521d\u59cb\u5bb9\u91cf\u4e3a 10\n    private static final int DEFAULT_CAPACITY = 10;\n    \/\/\u7a7a\u6570\u7ec4\n    private static final Object[] EMPTY_ELEMENTDATA = {};\n    \/\/\u9ed8\u8ba4\u7684\u7a7a\u6570\u7ec4\n    private static final Object[] DEFAULTCAPACITY_EMPTY_ELEMENTDATA = {};\n    \/\/\u5b58\u653e\u5143\u7d20\u7684\u5bf9\u8c61\u6570\u7ec4\n    transient Object[] elementData;\n    \/\/\u96c6\u5408\u4e2d\u5143\u7d20\u7684\u4e2a\u6570\n    private int size;\n    \/\/\u6700\u5927\u5bb9\u91cf\n    private static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;<\/code><\/pre>\n
1.\u5728jdk1.8\u4e2dArrayList\u5e95\u5c42\u5148\u521b\u5efa\u4e00\u4e2a\u957f\u5ea6\u4e3a0\u7684\u6570\u7ec4<\/p>\n
\/\/\u5982\u679c\u5728\u521b\u5efa\u96c6\u5408\u7684\u65f6\u5019\u6307\u5b9a\u4e86\u957f\u5ea6\uff0c\u90a3\u4e48\u5c31\u4f1a\u521b\u5efa\u4e00\u4e2a\u6307\u5b9a\u957f\u5ea6\u7684\u6570\u7ec4\u3002\npublic ArrayList(int initialCapacity) {\n        if (initialCapacity > 0) {\n            this.elementData = new Object[initialCapacity];\n        } else if (initialCapacity == 0) {\n            this.elementData = EMPTY_ELEMENTDATA;\n        } else {\n            throw new IllegalArgumentException("Illegal Capacity: "+initialCapacity);\n        }\n    }\n\/\/\u5982\u679c\u6ca1\u6709\u6307\u5b9a\uff0c\u5219\u662f\u4e00\u4e2a\u7a7a\u7684\u6570\u7ec4\u3002\n    public ArrayList() {\n        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;\n    }<\/code><\/pre>\n
2.\u5728\u7b2c\u4e00\u6b21\u6dfb\u52a0\u5143\u7d20\u65f6\uff0c\u4f1a\u521d\u59cb\u5316\u4e00\u4e2a\u957f\u5ea6\u4e3a10\u7684\u6570\u7ec4<\/p>\n
2.\u6269\u5bb9<\/h4>\n
    \n
  1. \u6269\u5bb9\u4f1a\u4f20\u5165\u4e00\u4e2aminCapacity(\u6700\u5c0f\u5bb9\u91cf)\uff0c\u82e5\u5f53\u524d\u6709size\u4e2a\u5143\u7d20\uff0c\u6709\u5143\u7d20\u7684\u6700\u540e\u4e00\u4e2a\u4e0b\u6807\u662fsize-1\uff0c\u6240\u4ee5\u6211\u4eec\u5f53\u524d\u4e00\u5b9a\u8981\u4fdd\u8bc1\u4e0b\u6807\u4e3asize\u7684\u7a7a\u95f4\u662f\u5b58\u5728\u7684\uff0c\u8fd8\u8981\u4fdd\u8bc1size+1 \u540e\u7684\u7a7a\u95f4\u662f\u5b58\u5728\u7684\uff0c\u6240\u4ee5\u6700\u5c0f\u5bb9\u91cf\u7684\u5b9a\u4e49\u4e3asize+1\u3002<\/li>\n
  2. \u56e0\u4e3a\u5f53ArrayList\u5bb9\u91cf\u4f7f\u7528\u5b8c\u4e4b\u540e\uff0c\u5c31\u4f1a\u81ea\u52a8\u521b\u5efa\u5f53\u524d\u5bb9\u91cf1.5\u500d\u7684\u65b0\u6570\u7ec4\uff0c\u5e76\u5c06\u539f\u6570\u7ec4\u4e2d\u6240\u6709\u5143\u7d20\u62f7\u8d1d\u8fc7\u53bb\uff0c\u4f46\u662f\uff0c\u5982\u679c\u65b0\u6570\u7ec4\u7684\u957f\u5ea6\u5c0f\u4e8e\u6700\u5c0f\u5bb9\u91cf\uff0c\u90a3\u4e48\u5c06\u4ee5\u6700\u5c0f\u5bb9\u91cf\u4f5c\u4e3a\u65b0\u6570\u7ec4\u7684\u957f\u5ea6\uff0c\u5982\u679c\u65b0\u6570\u7ec4\u7684\u957f\u5ea6\u5927\u4e8eInteger\u7684\u6700\u5927\u503c-8\uff0c\u5c31\u4f1a\u4ee5Integer\u7684\u6700\u5927\u503c\u4f5c\u4e3a\u65b0\u6570\u7ec4\u7684\u957f\u5ea6\uff0c\u8fd9\u4f1a\u5bfc\u81f4\u6548\u7387\u964d\u4f4e\u3002<\/li>\n
  3. \u4f18\u5316\uff1a\u53ef\u4ee5\u4f7f\u7528\u6784\u9020\u65b9\u6cd5ArrayList(int initialCapacity)\u6216\u8005ensureCapacity(int initialCapacity)\u76f4\u63a5\u63d0\u4f9b\u4e00\u4e2a\u521d\u59cb\u5316\u5bb9\u91cf\uff0c\u907f\u514d\u521a\u5f00\u59cb\u5c31\u4e00\u76f4\u6269\u5bb9\uff0c\u9020\u6210\u6548\u7387\u964d\u4f4e\u3002<\/li>\n<\/ol>\n
    3.\u6784\u9020\u65b9\u6cd5<\/h4>\n
    \/\/\u521b\u5efa\u4e00\u4e2a\u6307\u5b9a\u521d\u59cb\u5316\u5bb9\u91cf\u4e3a initialCapactity \u7684\u7a7a\u5217\u8868\npublic ArrayList(int initialCapacity) {\n        if (initialCapacity > 0) {\n            this.elementData = new Object[initialCapacity];\n        } else if (initialCapacity == 0) {\n            this.elementData = EMPTY_ELEMENTDATA;\n        } else {\n            throw new IllegalArgumentException("Illegal Capacity: "+initialCapacity);\n        }\n    }\n\/\/\u521b\u5efa\u4e00\u4e2a\u7a7a\u5217\u8868\uff0c\u7b2c\u4e00\u6b21\u6dfb\u52a0\u4f1a\u5c06\u5bb9\u91cf\u521d\u59cb\u5316\u4e3a10\n    public ArrayList() {\n        this.elementData = DEFAULTCAPACITY_EMPTY_ELEMENTDATA;\n    }\n\/\/\u521b\u5efa\u4e00\u4e2a\u5305\u542b\u6307\u5b9a\u96c6\u5408\u4e2d\u6240\u6709\u5143\u7d20\u7684\u5217\u8868\n    public ArrayList(Collection<? extends E> c) {\n        \/\/ Collection \u8f6c\u4e3a\u6570\u7ec4\u8d4b\u7ed9 elementData\n        elementData = c.toArray();\n        if ((size = elementData.length) != 0) {\n            \/\/\u5982\u679c\u6570\u7ec4\u4e0d\u662f\u7a7a\uff0c\u5c06\u5143\u7d20\u590d\u5236\u8fdb\u96c6\u5408\n            if (elementData.getClass() != Object[].class)\n                elementData = Arrays.copyOf(elementData, size, Object[].class);\n        } else {\n            \/\/\u5426\u5219\u5b58\u5165\u4e00\u4e2a\u7a7a\u6570\u7ec4.\n            this.elementData = EMPTY_ELEMENTDATA;\n        }\n    }<\/code><\/pre>\n
    4.\u7279\u70b9<\/h4>\n
    (1).\u4f18\u70b9<\/h5>\n
      \n
    1. \u5411ArrayList\u672b\u5c3e\u6dfb\u52a0\u5143\u7d20(\u4f7f\u7528add()\u65b9\u6cd5)\u65f6\uff0c\u6548\u7387\u8f83\u9ad8\u3002<\/li>\n
    2. \u56e0\u4e3a\u5e95\u5c42\u662f\u6570\u7ec4\u7684\u539f\u56e0\u6240\u4ee5\u67e5\u8be2\u6548\u7387\u9ad8\u3002<\/li>\n<\/ol>\n
      (2).\u7f3a\u70b9<\/h5>\n
        \n
      1. \u6269\u5bb9\u4f1a\u9020\u6210\u6548\u7387\u964d\u4f4e(\u53ef\u4ee5\u901a\u8fc7\u6307\u5b9a\u521d\u59cb\u5316\u5bb9\u91cf\uff0c\u5728\u4e00\u5b9a\u7a0b\u5ea6\u4e0a\u5f97\u5230\u6539\u5584)<\/li>\n
      2. \u6570\u7ec4\u5f88\u96be\u5b58\u50a8\u5927\u6570\u636e\u91cf(\u5f88\u96be\u627e\u5230\u4e00\u5757\u5f88\u5927\u7684\u8fde\u7eed\u5185\u5b58\u7a7a\u95f4)<\/li>\n
      3. \u5982\u679c\u5411ArrayList\u4e2d\u95f4\u6dfb\u52a0\u5143\u7d20\uff0c\u9700\u8981\u79fb\u52a8\u5143\u7d20\uff0c\u4f1a\u5f71\u54cd\u6548\u7387\u3002<\/li>\n<\/ol>\n
        5.\u5e38\u7528\u5185\u90e8\u65b9\u6cd5<\/h4>\n
        (1).add\u65b9\u6cd5<\/h5>\n
        \/\/\u76f4\u63a5\u5c06\u5143\u7d20\u6dfb\u52a0\u5230\u6570\u7ec4\u7684\u672b\u5c3e\npublic boolean add(E e) {\n        \/\/\u5bb9\u91cf\u6821\u9a8c\n        ensureCapacityInternal(size + 1);  \/\/ Increments modCount!!\n        \/\/\u4ece\u6570\u7ec4\u7684\u672b\u5c3e\u5b58\u5165\u5143\u7d20\n        elementData[size++] = e;\n        return true;\n    }\n\/\/\u5c06\u5143\u7d20\u6dfb\u52a0\u5230\u4e0b\u6807\u4e3aindex\u7684\u4f4d\u7f6e\npublic void add(int index, E element) {\n        \/\/\u5224\u65adindex\u662f\u5426\u5408\u7406\n        rangeCheckForAdd(index);\n        \/\/\u5bb9\u91cf\u6821\u9a8c\n        ensureCapacityInternal(size + 1);  \/\/ Increments modCount!!\n        \/\/\u5c06index\u540e\u7684\u5143\u7d20\u540e\u79fb\uff0c\u5c06index\u7684\u4f4d\u7f6e\u7a7a\u51fa\u6765\uff0c\u63d2\u5165\u6570\u636e\n        System.arraycopy(elementData, index, elementData, index + 1,size - index);\n        elementData[index] = element;\n        size++;\n    }\n\/\/\nprivate void ensureCapacityInternal(int minCapacity) {\n\/*\n\u9996\u5148\u662f\u5224\u65ad\u73b0\u5728\u7684ArrayList\u662f\u4e0d\u662f\u7a7a\u7684\u3002\n\u5982\u679c\u662f\u7a7a\u7684\uff0c\u6700\u5c0f\u5bb9\u91cf\u5c31\u53d6\u9ed8\u8ba4\u5bb9\u91cf\u4e0e\u6700\u5c0f\u5bb9\u91cf\u7684\u6700\u5927\u503c\n*\/\n        if (elementData == DEFAULTCAPACITY_EMPTY_ELEMENTDATA) {\n            minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);\n        }\n        \/\/\u5224\u65ad\u662f\u5426\u6269\u5bb9\n        ensureExplicitCapacity(minCapacity);\n    }\n\/\/\u5224\u65ad\u662f\u5426\u9700\u8981\u6269\u5bb9\nprivate void ensureExplicitCapacity(int minCapacity) {\n        \/\/\u64cd\u4f5c\u6b21\u6570++\n        modCount++;\n        \/\/ overflow-conscious code\n        \/\/minCapactity\u4e3asize+1\uff0c\u5982\u679c\u4ed6\u8d85\u8fc7\u4e86\u5e95\u5c42\u6570\u7ec4\u7684\u957f\u5ea6,\u5c31\u4f1a\u89e6\u53d1\u6269\u5bb9\n        if (minCapacity - elementData.length > 0)\n            grow(minCapacity);\n    }<\/code><\/pre>\n
        (2).grow\u65b9\u6cd5<\/h5>\n
        private void grow(int minCapacity) {\n        \/\/ overflow-conscious code\n        \/\/\u6682\u5b58\u5b58\u50a8\u6570\u7ec4\u7684\u957f\u5ea6\n        int oldCapacity = elementData.length;\n        \/*\n        \u5b9a\u4e49\u6269\u5bb9\u540e\u6570\u7ec4\u7684\u957f\u5ea6\n        \u957f\u5ea6\u4e3a\u65e7\u6570\u7ec4\u957f\u5ea6+\u65e7\u6570\u7ec4\u957f\u5ea6\/2 \u4e5f\u5c31\u662f\u6269\u5bb91.5\u500d\u3002\n        *\/\n        int newCapacity = oldCapacity + (oldCapacity >> 1);\n        \/\/\u5982\u679c\u6269\u5bb9\u540e\u7684\u6570\u7ec4\u957f\u5ea6\u6bd4\u6700\u5c0f\u5bb9\u91cf\u8fd8\u8981\u5c0f\uff0c\u90a3\u4e48\u76f4\u63a5\u8ba9\u6700\u5c0f\u5bb9\u91cf\u4f5c\u4e3a\u6269\u5bb9\u540e\u6570\u7ec4\u957f\u5ea6\n        if (newCapacity - minCapacity < 0)\n            newCapacity = minCapacity;\n        \/*\n        MAX_ARRAY_SIZE\u4e3aInteger\u7684\u6700\u5927\u503c-8\n        \u5982\u679c\u6269\u5bb9\u540e\u7684\u6570\u7ec4\u957f\u5ea6+8\u6bd4Integer\u7684\u6700\u5927\u503c\u8fd8\u5927\n        \u90a3\u4e48\u8c03\u7528hugeCapacity\u65b9\u6cd5\n        *\/\n        if (newCapacity - MAX_ARRAY_SIZE > 0)\n            newCapacity = hugeCapacity(minCapacity);\n        \/\/ minCapacity is usually close to size, so this is a win:\n        \/\/\u5c06\u65e7\u6570\u7ec4\u7684\u5143\u7d20\u62f7\u8d1d\u5230\u6269\u5bb9\u540e\u7684\u6570\u7ec4\u4e2d\n        elementData = Arrays.copyOf(elementData, newCapacity);\n    }<\/code><\/pre>\n
        (3).hugeCapacity\u65b9\u6cd5<\/h5>\n
        private static int hugeCapacity(int minCapacity) {\n        \/\/\u6700\u5c0f\u5bb9\u91cf\u662f\u4e0d\u80fd\u5c0f\u4e8e0\u7684\n        if (minCapacity < 0) \/\/ overflow\n            throw new OutOfMemoryError();\n        \/\/\u5982\u679c\u6700\u5c0f\u5bb9\u91cf\u5927\u4e8eInteger\u7684\u6700\u5927\u503c-8\u5c31\u53d6Integer\u7684\u6700\u5927\u503c\uff0c\u5426\u5219\u5c31\u53d6Integer\u7684\u6700\u5927\u503c-8;\n        return (minCapacity > MAX_ARRAY_SIZE) ?\n            Integer.MAX_VALUE :\n            MAX_ARRAY_SIZE;\n    }<\/code><\/pre>\n
        (4).indexOf\u65b9\u6cd5<\/h5>\n
        \/\/\u7528\u4ee5\u5224\u65ad\u4e00\u4e2a\u5143\u7d20\u662f\u5426\u5728\u96c6\u5408\u4e2d\uff0c\u5b58\u5728\u5c31\u8fd4\u56de\u8be5\u5143\u7d20\u7d22\u5f15,\u5426\u5219\u8fd4\u56de-1\npublic int indexOf(Object o) {\n        \/\/\u5982\u679c\u5143\u7d20\u4e3anull\n        if (o == null) {\n            for (int i = 0; i < size; i++)\n                \/\/\u627e\u5230\u7b2c\u4e00\u4e2a\u4e3anull\u7684\u5143\u7d20\u8fd4\u56de\u4ed6\u7684\u7d22\u5f15\n                if (elementData[i]==null)\n                    return i;\n        } else {\n            for (int i = 0; i < size; i++)\n                \/\/\u5982\u679c\u4e0d\u4e3anull\uff0c\u5219\u8fd4\u56de\u7b2c\u4e00\u4e2a\u503c\u5339\u914d\u7684\u7d22\u5f15\n                if (o.equals(elementData[i]))\n                    return i;\n        }\n        \/\/\u5982\u679c\u627e\u4e0d\u5230\u5c31\u8fd4\u56de-1\n        return -1;\n    }\n\/\/\u4e0eindexof\u76f8\u4f3c\uff0clastIndexOf\u662f\u53cd\u5411\u904d\u5386\u8fd4\u56de\u7684\u662f\u6700\u540e\u51fa\u73b0\u5143\u7d20\u7684\u7d22\u5f15\npublic int lastIndexOf(Object o) {\n        if (o == null) {\n            for (int i = size-1; i >= 0; i--)\n                if (elementData[i]==null)\n                    return i;\n        } else {\n            for (int i = size-1; i >= 0; i--)\n                if (o.equals(elementData[i]))\n                    return i;\n        }\n        return -1;\n    }<\/code><\/pre>\n
        (5).get\u65b9\u6cd5<\/h5>\n
        public E get(int index) {\n        \/\/\u68c0\u9a8cindex\u662f\u5426\u5408\u7406\n        rangeCheck(index);\n        \/\/\u83b7\u53d6\u5143\u7d20\n        return elementData(index);\n    }\n\/\/\u68c0\u9a8cindex\u662f\u5426\u5408\u7406\nprivate void rangeCheck(int index) {\n        if (index >= size)\n            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));\n    }\n\/\/\u83b7\u53d6\u5143\u7d20\nE elementData(int index) {\n        return (E) elementData[index];\n    }<\/code><\/pre>\n
        (6).set\u65b9\u6cd5<\/h5>\n
        \/\/\u5c06\u7d22\u5f15\u4e3aindex\u7684\u5143\u7d20\u4fee\u6539\u4e3aelement\uff0c\u5e76\u8fd4\u56de\u65e7\u5143\u7d20\npublic E set(int index, E element) {\n        \/\/\u68c0\u9a8cindex\u662f\u5426\u5408\u7406\n        rangeCheck(index);\n        \/\/\u6682\u5b58\u7d22\u5f15\u4e3aindex\u7684\u5143\u7d20\n        E oldValue = elementData(index);\n        \/\/\u4fee\u6539\u7d22\u5f15\u4e3aindex\u7684\u5143\u7d20\n        elementData[index] = element;\n        \/\/\u8fd4\u56de\u65e7\u5143\u7d20\n        return oldValue;\n    }<\/code><\/pre>\n
        (7).remove\u65b9\u6cd5<\/h5>\n
        \/\/\u901a\u8fc7\u7d22\u5f15\u5220\u9664\uff0c\u5e76\u4e14\u8fd4\u56de\u5220\u9664\u503c\npublic E remove(int index) {\n        \/\/\u68c0\u9a8cindex\u662f\u5426\u5408\u7406\n        rangeCheck(index);\n        \/\/\u64cd\u4f5c\u6b21\u6570++\n        modCount++;\n        \/\/\u6682\u5b58\u5220\u9664\u6570\u636e\n        E oldValue = elementData(index);\n        \/\/\u8ba1\u7b97\u9700\u8981\u79fb\u52a8\u591a\u5c11\u4f4d\u6570\u7ec4\n        int numMoved = size - index - 1;\n        \/\/\u5982\u679c\u9700\u8981\u79fb\u52a8\u7684\u6b21\u6570\u5927\u4e8e0\uff0c\u5c31\u5c06index\u540e\u4e00\u4f4d\u7684\u5143\u7d20\u96c6\u4f53\u524d\u79fb\u4e00\u4f4d\n        if (numMoved > 0)\n            System.arraycopy(elementData, index+1, elementData, index,numMoved);\n        \/\/\u6e05\u7a7a\u6700\u540e\u4e00\u4f4d\n        elementData[--size] = null; \/\/ clear to let GC do its work\n        \/\/\u5220\u9664\u5220\u9664\u7684\u5143\u7d20\n        return oldValue;\n    }\n\/\/\u901a\u8fc7\u5143\u7d20\u5220\u9664\uff0c\u8fd4\u56de\u662f\u5426\u5220\u9664\u6210\u529f\npublic boolean remove(Object o) {\n        if (o == null) {\n        \/\/\u5982\u679c\u5143\u7d20\u4e3anull\uff0c\u5220\u9664\u7b2c\u4e00\u4e2a\u4e3anull\u7684\u5143\u7d20\n            for (int index = 0; index < size; index++)\n                if (elementData[index] == null) {\n                \/\/\u8c03\u7528fastRemove\u5220\u9664\n                    fastRemove(index);\n                    return true;\n                }\n        } else {\n        \/\/\u4ece\u5934\u904d\u5386\uff0c\u5220\u9664\u6570\u7ec4\u4e2d\u7b2c\u4e00\u4e2a\u7b49\u4e8eo\u7684\u5143\u7d20\u3002\n            for (int index = 0; index < size; index++)\n                if (o.equals(elementData[index])) {\n                    fastRemove(index);\n                    return true;\n                }\n        }\n        \/\/\u6570\u7ec4\u4e2d\u6ca1\u6709\u8be5\u5143\u7d20\u8fd4\u56defalse\n        return false;\n    }\n\/\/\u8df3\u8fc7\u8fb9\u754c\u67e5\u627e\uff0c\u6ca1\u6709\u8fd4\u56de\u503c\u7684\u5feb\u901f\u5220\u9664\nprivate void fastRemove(int index) {\n        \/\/\u64cd\u4f5c\u6b21\u6570++\n        modCount++;\n        \/\/\u8ba1\u7b97\u9700\u8981\u79fb\u52a8\u591a\u5c11\u4f4d\u6570\u7ec4\n        int numMoved = size - index - 1;\n        if (numMoved > 0)\n            System.arraycopy(elementData, index+1, elementData, index,numMoved);\n        \/\/\n        elementData[--size] = null; \/\/ clear to let GC do its work\n    }<\/code><\/pre>\n
        \u4e8c.LinkedList<\/h3>\n
        1.\u6570\u636e\u7ed3\u6784<\/h4>\n
        LinkedList \u5e95\u5c42\u662f\u4e00\u4e2a\u53cc\u5411\u94fe\u8868<\/strong>\uff0c\u5176\u5185\u90e8\u7ef4\u62a4\u4e86\u4e00\u4e2a\u9759\u6001\u7684\u7ed3\u70b9\u7c7b<\/p>\n
        private static class Node<E> {\n        E item;\n        Node<E> next;\n        Node<E> prev;\n\n        Node(Node<E> prev, E element, Node<E> next) {\n            this.item = element;\n            this.next = next;\n            this.prev = prev;\n        }\n    }<\/code><\/pre>\n
        2.\u7279\u70b9<\/h4>\n
          \n
        1. LinkedList\u4e5f\u6709\u4e0b\u6807\uff0c\u4f46\u662f\u5b83\u7684\u5e95\u5c42\u662f\u4f7f\u7528\u7684\u94fe\u8868\uff0c\u6240\u4ee5\u5185\u5b58\u4e0d\u4e00\u5b9a\u662f\u8fde\u7eed\u7684\u3002<\/li>\n
        2. \u53ef\u4ee5\u4f7f\u7528get(int index)\u65b9\u6cd5\uff0c\u8fd4\u56de\u94fe\u8868\u4e2d\u7b2c index \u4e2a\u5143\u7d20\uff0c\u6bcf\u6b21\u67e5\u627e\u90fd\u662f\u4ece\u5934\/\u5c3e\u7ed3\u70b9\u5f00\u59cb\u904d\u5386<\/strong>\u3002<\/li>\n
        3. \u589e\u5220\u6548\u7387\u8f83\u9ad8\uff0c\u67e5\u8be2\u6548\u7387\u8f83\u4f4e\uff0c\u591a\u7528\u4e8e\u589e\u5220\u64cd\u4f5c\u8f83\u591a\u7684\u573a\u666f\u3002<\/li>\n<\/ol>\n
          3.\u5e38\u7528\u5185\u90e8\u65b9\u6cd5<\/h4>\n
          (1).get\u65b9\u6cd5<\/h5>\n
          public E get(int index) {\n        \/\/\u5224\u65adindex\u662f\u5426\u5408\u7406\n        checkElementIndex(index);\n        \/\/\u8c03\u7528node\u65b9\u6cd5\u8fd4\u56de\u7b2cindex\u4e2a\u5143\u7d20\u7684\u503c\n        return node(index).item;\n    }\n\/\/node\u65b9\u6cd5\nNode<E> node(int index) {\n        \/\/ assert isElementIndex(index);\n        \/*\n        \u57fa\u4e8e\u5e95\u5c42\u662f\u53cc\u5411\u94fe\u8868\u7684\u7279\u6027\uff0c\u5728\u68c0\u7d22\u65f6\u5e76\u4e0d\u4f1a\u50bb\u50bb\u7684\u4ece\u7b2c\u4e00\u4e2a\u7ed3\u70b9\u5f00\u59cb\u904d\u5386\uff0c\n        \u5e95\u5c42\u4f1a\u5224\u65ad\u67e5\u8be2\u7684\u7d22\u5f15\u6709\u6ca1\u6709\u8d85\u8fc7\u94fe\u8868\u957f\u5ea6\u7684\u4e00\u534a\uff0c\n        \u5982\u679c\u6ca1\u6709\u4ece\u5934\u904d\u5386\uff0c\u5982\u679c\u8d85\u8fc7\u4e86\u4ece\u5c3e\u90e8\u904d\u5386\n        *\/\n        if (index < (size >> 1)) {\n            Node<E> x = first;\n            for (int i = 0; i < index; i++)\n                x = x.next;\n            return x;\n        } else {\n            Node<E> x = last;\n            for (int i = size - 1; i > index; i--)\n                x = x.prev;\n            return x;\n        }\n    }\n<\/code><\/pre>\n
          (2).add\u65b9\u6cd5<\/h5>\n
          public boolean add(E e) {\n        linkLast(e);\/\/\u4f7f\u7528\u5c3e\u63d2\u6cd5\u6dfb\u52a0\u5143\u7d20e\n        return true;\n    }\n\/\/\u5c3e\u63d2\u6cd5\nvoid linkLast(E e) {\n        \/\/\u4fdd\u5b58\u6700\u540e\u4e00\u4e2a\u5143\u7d20\u7684\u6307\u9488\n        final Node<E> l = last;\n        \/\/\u65b0\u5efa\u4e00\u4e2anewNode\u7ed3\u70b9\u4f5c\u4e3a\u5c3e\u7ed3\u70b9\n        final Node<E> newNode = new Node<>(l, e, null);\n        last = newNode;\n        \/\/\u5f53\u94fe\u8868\u4e3a\u7a7a\u65f6\uff0cnewNode\u5c31\u662f\u7b2c\u4e00\u4e2a\u7ed3\u70b9first\n        if (l == null)\n            first = newNode;\n        \/\/\u5f53\u94fe\u8868\u4e0d\u4e3a\u7a7a\uff0c\u6700\u540e\u4e00\u4e2a\u7ed3\u70b9\u7684next\u6307\u5411newNode\uff1b\n        else\n            l.next = newNode;\n        \/\/\u94fe\u8868\u957f\u5ea6++\n        size++;\n        \/\/\u4fee\u6539\u6b21\u6570++\n        modCount++;\n    }<\/code><\/pre>\n
          (3).addAll\u65b9\u6cd5<\/h5>\n
          public boolean addAll(Collection<? extends E> c) {\n        return addAll(size, c);\n    }\npublic boolean addAll(int index, Collection<? extends E> c) {\n        \/\/\u6821\u9a8cindex\u662f\u5426\u5408\u7406\n        checkPositionIndex(index);\n        \/\/\u8c03\u7528toArray\u65b9\u6cd5\uff0c\u5c06\u96c6\u5408\u62f7\u8d1d\u4e3a\u4e00\u4e2a\u6570\u7ec4\n        Object[] a = c.toArray();\n        \/\/\u83b7\u53d6\u6570\u7ec4\u7684\u957f\u5ea6\n        int numNew = a.length;\n        \/\/\u5982\u679c\u6570\u7ec4\u662f\u7a7a\u7684\uff0c\u8fd4\u56de\n        if (numNew == 0)\n            return false;\n        \/*\n        \u5b9a\u4e49\u4e24\u4e2a\u7ed3\u70b9\n        pred \u6765\u5b58\u50a8\u524d\u4e00\u4e2a\u8282\u70b9\u7684\u5f15\u7528\n        succ\u5b58\u50a8\u5f53\u524d\u8282\u70b9\n        *\/\n        Node<E> pred, succ;\n        \/\/\u5982\u679c\u7d22\u5f15index\u7b49\u4e8e\u94fe\u8868\u957f\u5ea6\uff0c\u90a3\u4e48\u76f4\u63a5\u4ece\u672b\u5c3e\u6dfb\u52a0\u7ed3\u70b9\n        if (index == size) {\n            succ = null;\n            pred = last;\n        } else {\n        \/\/\u5426\u5219\u5c31\u4ece\u7d22\u5f15\u5904\u6dfb\u52a0\u7ed3\u70b9\n            succ = node(index);\n            pred = succ.prev;\n        }\n        \/\/\u904d\u5386\u6570\u7ec4\u5143\u7d20\u8fdb\u884c\u6dfb\u52a0\u64cd\u4f5c\n        for (Object o : a) {\n            @SuppressWarnings("unchecked") E e = (E) o;\n            \/\/\u5c06\u96c6\u5408\u5143\u7d20 \u7684prev\u6307\u5411pred\n            Node<E> newNode = new Node<>(pred, e, null);\n            if (pred == null)\n            \/\/\u5982\u679c\u662f\u7a7a\u94fe\u8868\uff0c\u90a3\u4e48newNode\u5c31\u662f\u5934\u7ed3\u70b9\n                first = newNode;\n            else\n            \/\/\u5426\u8005pred\u7684\u540e\u7ee7\u5c31\u662fnewNode\n                pred.next = newNode;\n            pred = newNode;\n        }\n        \/\/\u5982\u679c\u5f53\u524d\u8fd9\u4e2a\u7ed3\u70b9\u662f\u7a7a\u7684\n        if (succ == null) {\n            \/\/pred\u7ed3\u70b9\u4e3a\u6700\u540e\u4e00\u4e2a\u7ed3\u70b9\n            last = pred;\n        } else {\n            \/\/\u5426\u5219pred\u7684\u4e0b\u4e00\u4e2a\u5f15\u7528\u6307\u5411succ\n            pred.next = succ;\n            \/\/\u5c3e\u8282\u70b9\u7684\u4e0a\u4e00\u4e2a\u5f15\u7528\u6307\u5411pred\n            succ.prev = pred;\n        }\n        \/\/\u539f\u6765\u7684size+\u65b0\u6dfb\u52a0\u7684\u6570\u7ec4\u957f\u5ea6 \u5c31\u662f\u65b0\u94fe\u8868\u7684size\n        size += numNew;\n        \/\/\u64cd\u4f5c\u6b21\u6570++\n        modCount++;\n        return true;\n    }\n\/\/\u5185\u90e8\u7ed3\u70b9\u7c7b\u6784\u9020\u65b9\u6cd5\nNode(Node<E> prev, E element, Node<E> next) {\n            this.item = element;\n            this.next = next;\n            this.prev = prev;\n        }<\/code><\/pre>\n
          (4).remove\u65b9\u6cd5<\/h5>\n
          \/\/\u6839\u636e\u7d22\u5f15\u5220\u9664\u7ed3\u70b9\npublic E remove(int index) {\n        checkElementIndex(index);\n        return unlink(node(index));\n    }\n\/\/\u6839\u636e\u5143\u7d20\u5220\u9664\u7ed3\u70b9\npublic boolean remove(Object o) {\n        \/\/\u5355\u72ec\u5904\u7406null\n        if (o == null) {\n            for (Node<E> x = first; x != null; x = x.next) {\n            \/\/\u904d\u5386\u5230\u4e3anull\u7684\u5143\u7d20\uff0c\u79fb\u9664\u6389\n                if (x.item == null) {\n                    unlink(x);\n                    return true;\n                }\n            }\n        } else {\n            for (Node<E> x = first; x != null; x = x.next) {\n            \/\/\u904d\u5386\u5230\u503c\u7b49\u4e8eo\u7684\u7ed3\u70b9\u76f4\u63a5\u79fb\u9664\u6389\n                if (o.equals(x.item)) {\n                    unlink(x);\n                    return true;\n                }\n            }\n        }\n        return false;\n    }\n\/\/\u4f7f\u7528unlink\u65b9\u6cd5\u62ff\u6389\u7ed3\u70b9\nE unlink(Node<E> x) {\n        \/\/\u65ad\u8a00x\u4e0d\u4e3a\u7a7a\n        \/\/ assert x != null;\n        final E element = x.item; \/\/\u6682\u5b58x\u7ed3\u70b9\n        final Node<E> next = x.next;\/\/\u6682\u5b58x\u7684\u540e\u7ee7\u7ed3\u70b9\n        final Node<E> prev = x.prev;\/\/\u6682\u5b58x\u7684\u524d\u9a71\u7ed3\u70b9\n        if (prev == null) {\n        \/\/\u5982\u679cx\u662f\u5934\u7ed3\u70b9\uff0c\u628ax\u7684\u540e\u7ee7\u7ed3\u70b9\u8bbe\u4e3a\u5934\u8282\u70b9\n            first = next;\n        } else {\n            \/\/\u8df3\u8fc7x\u7ed3\u70b9\n            prev.next = next;\n            \/\/\u65ad\u5f00x\u7ed3\u70b9\u7684\u524d\u9a71\n            x.prev = null;\n        }\n        if (next == null) {\n        \/\/\u5982\u679cx\u7ed3\u70b9\u662f\u5c3e\u7ed3\u70b9\uff0c\u5c06x\u7684\u524d\u9a71\u7ed3\u70b9\u8bbe\u7f6e\u4e3a\u5c3e\u7ed3\u70b9\n            last = prev;\n        } else {\n            \/\/\u8df3\u8fc7x\u7ed3\u70b9\n            next.prev = prev;\n            \/\/\u65ad\u5f00x\u7ed3\u70b9\u7684\u540e\u7ee7\n            x.next = null;\n        }\n        \/\/\u5c06x\u7ed3\u70b9\u7684\u503c\u6e05\u7a7a\n        x.item = null;\n        \/\/\u94fe\u8868\u957f\u5ea6--\n        size--;\n        \/\/\u64cd\u4f5c\u6b21\u6570++\n        modCount++;\n        \/\/\u4e4b\u524d\u6709\u505a\u6682\u5b58\uff0c\u5c06\u88ab\u5220\u9664\u7684\u7ed3\u70b9\u8fd4\u56de\u56de\u53bb\n        return element;\n    }<\/code><\/pre>\n
          (5).set\u65b9\u6cd5<\/h5>\n
          public E set(int index, E element) {\n        \/\/\u6821\u9a8cindex\u662f\u5426\u5408\u7406\n        checkElementIndex(index);\n        \/\/\u627e\u5230\u7d22\u5f15\u4e3aindex\u7684\u7ed3\u70b9\n        Node<E> x = node(index);\n        \/\/\u4fdd\u5b58x\u7ed3\u70b9\u7684\u503c\n        E oldVal = x.item;\n        \/\/\u5c06x\u7ed3\u70b9\u7684\u503c\u8bbe\u4e3aelement\n        x.item = element;\n        \/\/\u5c06\u4e4b\u524d\u7684\u503c\u8fd4\u56de\n        return oldVal;\n    }<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
          \u4e00.ArrayList 1.\u6570\u636e\u7ed3\u6784 ArrayList\u5e95\u5c42\u6570\u636e\u7ed3\u6784\u662f\u4e00\u4e2aObject[]\u6570\u7ec4\uff0c\u5e95\u5c42\u6570\u7ec4\u7684\u9ed8\u8ba4\u521d\u59cb\u5316\u5bb9\u91cf\u4e3a10\u3002  …<\/p>","protected":false},"author":1,"featured_media":595,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[41],"tags":[42,44,43],"_links":{"self":[{"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/posts\/587"}],"collection":[{"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/comments?post=587"}],"version-history":[{"count":17,"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/posts\/587\/revisions"}],"predecessor-version":[{"id":605,"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/posts\/587\/revisions\/605"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/media\/595"}],"wp:attachment":[{"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/media?parent=587"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/categories?post=587"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/bigwer.cn\/index.php\/wp-json\/wp\/v2\/tags?post=587"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}