1.给定一个整型数组, 实现冒泡排序(升序排序)
public static void bubbleSort(int[] array) {
for (int i = 0; i < array.length-1; i++) {
boolean flag = true;
for (int j = 0; j < array.length-1-i; j++) {
if(array[j] > array[j+1]) {
int tmp = array[j];
array[j] = array[j+1];
array[j+1] = tmp;
flag = false;
}
}
if(flag) {
break;
}
}
}
public static void main(String[] args) {
int[] array = {3,7,6,8,1,2};
bubbleSort(array);
System.out.println(Arrays.toString(array));
}
2.给定一个有序整型数组, 实现二分查找
public static int binarySearch(int[] array,int key) {
int left = 0;
int right = array.length-1;
while(left <= right) {
int mid = (left+right)>>>1;
if(array[mid] > key) {
right = mid - 1;
} else if(array[mid] < key){
left = mid + 1;
} else {
return mid;
}
}
return -1;
}
public static void main(String[] args) {
int[] array = {1,2,3,4,5,6};
System.out.println(binarySearch(array, 7));
}
3.有一组数据,只有一个数字是出现一次,其他是两次,请找出这个数字
public static int find(int[] array) {
int ret = 0;
for (int i = 0; i <array.length ; i++) {
ret^=array[i];
}
return ret;
}
public static void main(String[] args) {
int[] array = {1,1,2,2,3,3,4};
System.out.println(find(array));
}
4.调整数组顺序使得偶数位于奇数之前。调整之后,不关心大小顺序。
public static void swap(int[] array) {
int left = 0;
int right = array.length - 1;
while (left < right) {
while (left < right && array[left] % 2 == 0) {
left++;
}
while(left < right && array[right] %2 != 0) {
right--;
}
if(left < right) {
int tmp = array[left];
array[left] = array[right];
array[right] = tmp;
}
}
}
public static void main(String[] args) {
int[] array = {1,2,3,4,5,6,7,8,9,10};
swap(array);
System.out.println(Arrays.toString(array));
}