接着上述的的练习题
(六)默写单例模式懒汉和饿汉模式
懒汉式
public class Lazy {
private Lazy() {}
private static Lazy instance = null;
public static Lazy getInstance() {
if (instance==null) {
instance = new Lazy();
}
return instance;
}
}
饿汉模式
public class HangrySingle {
private static HangrySingle instance = new HangrySingle();
private HangrySingle() {
}
public static HangrySingle getInstance() {
return instance;
}
}
七.默写冒泡排序和选择排序
冒泡排序
public class Demo08 {
public static void main(String[] args) {
int [] nums = new int[] {11,65,23,98,566,12,02,30,78};
for (int i = 0; i < nums.length-1; i++) {
for (int j = 0; j < nums.length-1-i; j++) {
if (nums[j]>nums[j+1]) {
int temp = nums[j];
nums[j] =nums[j+1];
nums[j+1] = temp;
}
}
}
System.out.println(Arrays.toString(nums));
}
}
选择排序
public class Demo09 {
public static void main(String[] args) {
int[] arr = { 45, 12, 65, 20, 89, 65, 30, 74 };
for (int i = 0; i < arr.length - 1; i++) {
int min = i;
for (int j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[min]) {
min = j;
}
}
if (min != i) {
swap(arr, i, min);
}
}
System.out.println(Arrays.toString(arr));
}
// 完成数组两元素间交换
public static void swap(int[] arr, int a, int b) {
int temp = arr[a];
arr[a] = arr[b];
arr[b] = temp;
}
}