<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                ??一站式輕松地調用各大LLM模型接口,支持GPT4、智譜、豆包、星火、月之暗面及文生圖、文生視頻 廣告
                # Java 中的自定義列表實現示例 > 原文: [https://howtodoinjava.com/data-structure/list-implementation-example-in-java/](https://howtodoinjava.com/data-structure/list-implementation-example-in-java/) 在本教程中,我將給出 Java 中`List`的示例**實現**。 通過在`DemoList`類中添加或刪除方法,可以隨意自定義列表的行為。 如果您有一些想法可以改善此實現,請與我們分享。 ## Java 列表實現示例 在此類`DemoList.java`中,我們將創建具有以下功能的`List`實現: * 列表可能會從零增長到無限大小(至少在理論上是這樣)。 * 創建列表時,將使用最少 10 個元素初始化列表。 * 列表將提供在生命周期中任何狀態下獲取,添加,刪除和打印列表的方法。 ## 列表實現的源代碼 ```java package com.howtodoinjava.datastructure; import java.util.Arrays; public class DataList<E> { //Size of list private int size = 0; //Default capacity of list is 10 private static final int DEFAULT_CAPACITY = 10; //This array will store all elements added to list private Object elements[]; //Default constructor public DataList() { elements = new Object[DEFAULT_CAPACITY]; } //Add method public void add(E e) { if (size == elements.length) { ensureCapacity(); } elements[size++] = e; } //Get method @SuppressWarnings("unchecked") public E get(int i) { if (i >= size || i < 0) { throw new IndexOutOfBoundsException("Index: " + i + ", Size " + i); } return (E) elements[i]; } //Remove method @SuppressWarnings("unchecked") public E remove(int i) { if (i >= size || i < 0) { throw new IndexOutOfBoundsException("Index: " + i + ", Size " + i); } Object item = elements[i]; int numElts = elements.length - ( i + 1 ) ; System.arraycopy( elements, i + 1, elements, i, numElts ) ; size--; return (E) item; } //Get Size of list public int size() { return size; } //Print method @Override public String toString() { StringBuilder sb = new StringBuilder(); sb.append('['); for(int i = 0; i < size ;i++) { sb.append(elements[i].toString()); if(i<size-1){ sb.append(","); } } sb.append(']'); return sb.toString(); } private void ensureCapacity() { int newSize = elements.length * 2; elements = Arrays.copyOf(elements, newSize); } } ``` 讓我們快速測試一下`List`的實現。 ```java package com.howtodoinjava.datastructure; public class Main { public static void main(String[] args) { DataList<Integer> list = new DataList<>(); //Add elements list.add(1); list.add(2); list.add(3); System.out.println(list); //Remove elements from index list.remove(2); System.out.println(list); //Get element with index System.out.println( list.get(0) ); System.out.println( list.get(1) ); //List Size System.out.println(list.size()); } } ``` ```java Output: [1,2,3,4,5] [1,2,4,5] 1 2 4 ``` 如以上輸出所示,我們的列表實現能夠提供所有必要的功能。 學習愉快!
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看