package com.njwb.array;
import java.util.Arrays;
import java.util.Scanner;
public class RowChar {
public static void main(String[] args) {
char[] rowChar = {'a','c','u','b','e','p','f','z'};
Scanner input = new Scanner(System.in);
System.out.println("原有数组:"+ Arrays.toString(rowChar));
//升序
char temp;
for (int i = 0; i < rowChar.length-1; i++) {
for (int j = 0; j < rowChar.length-1-i; j++) {
if (rowChar[j] > rowChar[j+1]) {
temp = rowChar[j];
rowChar[j] = rowChar[j+1];
rowChar[j+1] = temp;
}
}
}
System.out.println("升序后:"+Arrays.toString(rowChar));
System.out.println("输入一个字母:");
char newChar = input.next().charAt(0);
char[] newRowChar = new char[rowChar.length+1];
int index = rowChar.length;
for (int i = 0; i < rowChar.length; i++) {
if (rowChar[i] > newChar) {
index = i;
break;
}
}
System.out.println("index:"+index);
for (int i = 0; i < newRowChar.length; i++) {
if (i
newRowChar[i] = rowChar[i];
}else if (i == index){
newRowChar[i] = newChar;
}else if (i>index){
newRowChar[i] = rowChar[i-1];
}
}
System.out.println("升序后:"+Arrays.toString(newRowChar));
}
}
for循环数组rowChar.length得到数组的长度,遍历数组里的每一个值,通过冒泡算法交换字符排序。
如有出入,欢迎指正!!!



