1.冒泡排序
package com.tulun.src;
import java.util.Arrays;
import java.util.Scanner;
public class Arr2 {
/**
* 冒泡排序
*/
public static void bubbleSort(int[] arr){
for(int i=0;i<arr.length;i++){//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;
}
}
}
}
public static void main (String[] args){
int[] arr = {3,2,5,7,6,1};
bubbleSort(arr);
System.out.println(Arrays.toString(arr));
}
}
2.字符替换
1)##替换空格
package com.tulun.src;
import java.util.Arrays;
import java.util.Scanner;
public class Arr2 {
public static int getCount(char[] ch){
int count = 0;
for(int i=0;i<ch.length;i++){
if(ch[i] == ' '){
count++;
}
}
return count;
}
public static String replaceBlank(String str){
char[] ch = str.toCharArray();//背
int count = getCount(ch);
char[] chNew = Arrays.copyOf(ch,ch.length+count);
int i = 0,j = 0;
for(;i<ch.length;i++){
if(ch[i] !=' '){
chNew[j++] = ch[i];
}else{
chNew[j++] = '#';
chNew[j++] = '#';
}
}
return String.copyValueOf(chNew);//背
}
public static void main (String[] args){
String str ="i am a student";
str = replaceBlank(str);
System.out.println(str);
}
}
2)任意字符替换
import java.util.Arrays;
import java.util.Scanner;
public class Arr3 {
/**
* 2.字符替换
*/
public static int getCount(char [] ch){
int count = 0;
for(int i = 0;i < ch.length;i++){
if(ch[i] == ' '){
count++;
}
}
return count;
}
public static String replaceBlank(String str, char a,char chr, int times){
char [] ch = str.toCharArray();//字符串转化为字符
int count = getCount(ch) * (times - 1);
char [] chNew = Arrays.copyOf(ch,ch.length + count);
int i = 0,j = 0;
for(;i < ch.length;i++){
if(ch[i] != a){
chNew[j++] = ch[i];
}else{
for(int tmp = 0; tmp < times; tmp += 1) {
chNew[j++] = chr;
}
}
}
return String.copyValueOf(chNew);
}
public static void main(String[] args) {
String str = "i am a student";
str = replaceBlank(str,'a','%',3);
System.out.println(str);
}
}
3.打印三角
package com.tulun.src;
import java.util.Arrays;
import java.util.Scanner;
public class Arr2 {
public static int[][] printTran(int n){
int[][] arr = new int[n][n];
for(int i=0;i<arr.length;i++){
for(int j=i+1;j<arr[i].length;j++){
//第一列全为1,对角线全为1
if(j == 0 || i == j){
arr[i][j] = 1;
}else if(i-1 >= 0){
//当前元素是上一行同一列元素+1
arr[i][j] = arr[i-1][j]+1;
}
}
}
for(int i=0;i<arr.length;i++){
for(int j=0;j<arr[i].length;j++){
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
return arr;
}
public static void main (String[] args){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[][] arr =printTran(5);
System.out.println(Arrays.deepToString(arr));
}
}