<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>

                ThinkChat2.0新版上線,更智能更精彩,支持會話、畫圖、視頻、閱讀、搜索等,送10W Token,即刻開啟你的AI之旅 廣告
                # Java `LinkedHashSet`示例 > 原文: [https://javatutorial.net/java-linkedhashset-example](https://javatutorial.net/java-linkedhashset-example) Java 中的`LinkedHashSet`類與[`HashSet`](https://javatutorial.net/java-hashset-example)不同,因為其實現維護了所有元素上的雙鏈表。 此鏈表定義了迭代順序,即將元素插入到集合中的順序。 這稱為插入順序。 如果將元素重新插入到集合中,則插入順序不受其影響。 某些人更喜歡此實現,因為它使用戶擺脫了[`HashSet`](https://javatutorial.net/java-hashset-example)提供的未指定且混亂的排序。 ![java-featured-image](https://img.kancloud.cn/05/3e/053ee0bb59842d92359246c98f815e0c_780x330.jpg) ## `LinkedHashSet`的優點 * `LinkedHashSet`維護元素的插入順序 * 插入,刪除和檢索操作的時間復雜度為`O(1)`(恒定時間)。 * `LinkedHashSet`允許 1 個`null`元素。 * `LinkedHashSet`使用`equals()`和`hashCode()`,因此可以刪除可能的重復元素。 ## 繼承圖 ![Inheritance diagram of LinkedHashSet](https://img.kancloud.cn/6e/ec/6eec21d491f18624cd30d4d0dc04e18f_334x497.jpg) `LinkedHashSet`的繼承圖 ## `LinkedHashSet`中的構造方法 1. `LinkedHashSet()`:初始化一個新的鏈接哈希集,默認初始容量為 16,負載因子為 0.75。 2. `LinkedHashSet(Collection <? extends E> c)`:使用與指定集合相同的元素初始化一個新的鏈接哈希集。 3. `LinkedHashSet(int initialCapacity)`:使用指定的初始容量初始化一個新的鏈接哈希集。 4. `LinkedHashSet(int initialCapacity, float loadFactor)`:使用指定的容量和負載因子初始化一個新的鏈接哈希集。 ## `LinkedHashSet`中的方法 1. 從類`java.util.HashSet`繼承的方法:[`add`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#add(E)),[`clear`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#clear()),[`clone`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#clone()),[`contains`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#contains(java.lang.Object)), [`isEmpty`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#isEmpty()) , [`iterator`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#iterator()),[`remove`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#remove(java.lang.Object)),[`size`](https://docs.oracle.com/javase/7/docs/api/java/util/HashSet.html#size()) 2. 從類`java.util.AbstractSet`繼承的方法:[`equals`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractSet.html#equals(java.lang.Object)), [`hashCode`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractSet.html#hashCode()) , [`removeAll`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractSet.html#removeAll(java.util.Collection)) 3. 從類`java.util.AbstractCollection`繼承的方法: [`addAll`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractCollection.html#addAll(java.util.Collection)) , [`containsAll`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractCollection.html#containsAll(java.util.Collection)) , [`keepAll`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractCollection.html#retainAll(java.util.Collection)) , [`toArray`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractCollection.html#toArray()) , [`toArray(T[])`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractCollection.html#toArray(T[])) , [`toString`](https://docs.oracle.com/javase/7/docs/api/java/util/AbstractCollection.html#toString()) 4. 從類`java.lang.Object`繼承的方法:[`finalize`](https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html#finalize()), [`getClass`](https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html#getClass()) ,[`notify`](https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html#notify()), [`notifyAll`](https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html#notifyAll()) , [`wait`](https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html#wait()) , [`wait(long)`](https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html#wait(long)),[`wait(long, int)`](https://docs.oracle.com/javase/7/docs/api/java/lang/Object.html#wait(long,%20int)) 5. 從接口`java.util.Set`繼承的方法: [`add`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#add(E)) , [`addAll`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#addAll(java.util.Collection)) ,[`clear`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#clear()),[`contains`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#contains(java.lang.Object)), [`containsAll`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#containsAll(java.util.Collection)) , [`equals`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#equals(java.lang.Object)), [`hashCode`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#hashCode()) , [`isEmpty`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#isEmpty()) ,[`iterator`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#iterator()),[`remove`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#remove(java.lang.Object)), [`removeAll`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#removeAll(java.util.Collection)) , [`retainAll`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#retainAll(java.util.Collection)) ,[`size`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#size()), [`toArray`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#toArray()) , [`toArray(T[])`](https://docs.oracle.com/javase/7/docs/api/java/util/Set.html#toArray(T[])) 有關所有方法的文檔,請訪問 [Oracle 官方文檔頁面](https://docs.oracle.com/javase/7/docs/api/java/util/LinkedHashSet.html)。 ## 使用`Iterator()`迭代`LinkedHashSet` ```java import java.util.*; class LinkedHashSetExample{ public static void main(String args[]){ LinkedHashSet<String> animals=new LinkedHashSet(); animals.add("Elephant"); animals.add("Tiger"); animals.add("Lion"); Iterator<String> iterator=animals.iterator(); while(iterator.hasNext()) { System.out.println(iterator.next()); } } } ``` **輸出**: ```java Elephant Tiger Lion ``` ## 使用`Fo??r`循環遍歷`LinkedHashSet` ```java LinkedHashSet<String> linkedHashSet = new LinkedHashSet<String>(); for (int i = 0; i < linkedHashSet.size(); i++) { System.out.println(linkedHashSet.get(i)); } ``` ## 使用增強`For`循環遍歷`LinkedHashSet` ```java for (String temp : linkedHashSet) { System.out.println(temp); } ``` ## 使用`While`循環遍歷`LinkedHashSet` ```java int i = 0; while (i < linkedHashSet.size()) { System.out.println(linkedHashSet.get(i)); i++; } ``` ## `LinkedHashSet`的示例程序 ```java import java.util.LinkedHashSet; public class LinkedHashSetExample { public static void main(String[] args) { LinkedHashSet<String> coins = new LinkedHashSet<String>(); // Adding element to LinkedHashSet coins.add("5"); coins.add("10"); coins.add("20"); coins.add("50"); coins.add("100"); // Adding a duplicate would result in no addition of the element coins.add("5"); // Adding another coin value coins.add("75"); System.out.println("Size of the list = " + coins.size()); System.out.println("Original LinkedHashSet:" + coins); System.out.println("Removing 75 from LinkedHashSet: " + coins.remove("75")); System.out.println("Checking if 50 is present=" + coins.contains("50")); System.out.println("Updated LinkedHashSet: " + coins); } } ``` **輸出**: ```java Size of LinkedHashSet=5 Original LinkedHashSet:[5, 10, 20, 50, 75, 100] Removing 75 from LinkedHashSet: true Checking if 50 is present=true Updated LinkedHashSet:[5, 10, 20, 50, 100] ```
                  <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>

                              哎呀哎呀视频在线观看