package Bibi.ArrayPack;
public class ArrayTest1 {
public static void func1() {
int[] array1, array2;
array1 = new int[]{2, 3, 5, 7, 11, 13, 17, 19};
array2 = array1;
for (int i = 0; i < array2.length; i++) {
if (i % 2 == 0) {
array2[i] = i;
}
}
for (int i : array1) {
System.out.println(i);
}
}
public static void func2(){
String[] arr = new String[]{"JJ", "DD", "MM", "BB", "GG", "AA"};
String[] arr1 = new String[arr.length];
for (int i = 0; i < arr1.length; i++) {
arr1[i] = arr[i];
}
String dest = "BB";
boolean isFlag = true;
for (int i = 0; i < arr.length; i++) {
if (dest.equals(arr[i])) {
System.out.println("找到了指定的元素,位置为:" + i);
isFlag = false;
break;
}
}
if (isFlag) {
System.out.println("没找到");
}
int[] arr2 = new int[]{-98, -34, 2, 34, 54, 66, 79, 105, 210, 333};
int dest2 = -34;
int head = 0, tail = arr2.length-1;
boolean isFlag2 = true;
while (head <= tail) {
int middle = (tail - head)/2 + head;
if (dest2 == arr2[middle]) {
System.out.println("找到了指定的元素,位置为:" + middle);
isFlag2 = false;
break;
} else if (arr2[middle] > dest2) {
tail = middle - 1;
} else {
head = middle + 1;
}
}
if (isFlag2) {
System.out.println("没找到");
}
}
public static void main(String[] args) {
func2();
}
}
package Bibi.ArrayPack;
import java.util.Arrays;
public class ArraySortTest {
public static void bubbleSort() {
int[] arr = new int[]{89, 12, 34, 67, 45, 10};
for (int i = 0; i < arr.length-1; i++) {
for (int j = 0; j < arr.length-1-i; j++) {
if (arr[j] > arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
System.out.println(Arrays.toString(arr));
}
public static void quickSort() {}
public static void func1() {
int[] arr1 = new int[]{1, 2, 2, 3};
int[] arr2 = new int[]{1, 2, 2, 3};
System.out.println(Arrays.equals(arr1, arr2));
System.out.println(Arrays.toString(arr1));
Arrays.fill(arr2, 10);
System.out.println(Arrays.toString(arr2));
System.out.println(Arrays.binarySearch(arr1, 2));
}
public static void func2() {
}
public static void main(String[] args) {
func2();
}
}