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

                ??碼云GVP開源項目 12k star Uniapp+ElementUI 功能強大 支持多語言、二開方便! 廣告
                >[danger] ##### 數組遍歷 設計一個方法用于數組遍歷,要求遍歷的結果是在一行上的。輸出結果例如:[11, 22, 33, 44, 55] ~~~ public class Test { public static void main(String[] args) { int[] array = { 2, 4, 5, 7, 1, 5, 8, 7 }; printArr(array); // [2,4,5,7,1,5,8,7] int[] array1 = { 2 }; printArr(array1); // [2] } public static void printArr(int[] array) { String res = ""; for (int i = 0; i < array.length; i++) { // 判斷是否是最后一個位 如果是最后一位不加 逗號分割 if (i + 1 == array.length) { res += array[i]; } else { res += array[i] + ","; } } System.out.print("[" + res + "]"); } } ~~~ >[danger] ##### 數組最大值 1. 需求:設計一個方法用于獲取數組中元素的最大值 ~~~ public class Test { public static void main(String[] args) { int[] array = { 1, 5, 7 }; int maxNum = getMax(array); System.out.println(maxNum); int[] array1 = { 1 }; int maxNum1 = getMax(array1); System.out.println(maxNum1); } public static int getMax(int[] array) { // 先斷言第一個值就是數組中的最大值 int maxNum = array[0]; for (int i = 1; i < array.length; i++) { // 循環更新依次比較找到最大值 if (maxNum < array[i]) { maxNum = array[i]; } } return maxNum; } } ~~~ >[danger] ##### 獲取索引 1. 定義一個方法獲取數字,在數組中的索引位置,將結果返回給調用處,如果有重復的,只要獲取第一個即可 ~~~ public class Test { public static void main(String[] args) { int[] array = { 1, 2, 5, 7 }; int index = findIndex(array, 7); int index1 = findIndex(array, 17); System.out.println(index); // 3 System.out.println(index1); // -1 } public static int findIndex(int[] array, int findNum) { int index = -1; for (int i = 1; i < array.length; i++) { if (array[i] == findNum) { index = i; break; } } return index; } } ~~~ >[danger] ##### copy 數組 ~~~ import java.util.Arrays; public class Test { public static void main(String[] args) { int[] array = { 2, 5, 4, 6, 7 }; int[] cA = copyArray(array, 2, 4); System.out.print(Arrays.toString(cA)); // [4, 6] } public static int[] copyArray(int[] array, int form, int to) { int len = to - form; int[] cArray = new int[len]; // 初始index int index = 0; for (int i = form; i < to; i++) { cArray[index] = array[i]; // 增加索引 index++; } return cArray; } } ~~~
                  <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>

                              哎呀哎呀视频在线观看