每日练习随笔
package com.sxt.KeTang;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Job2 {
public static void main(String[] args) {
int [] arr = {8,4,2,1,23,344,12};
System.out.println(arrayToString(arr));
System.out.println("和是:"+add(arr));
System.out.println("最大值:"+maxNum(arr));
System.out.println("倒置前:"+arrayToString(arr));
reverseArray(arr);
System.out.println("倒置后:"+arrayToString(arr));
System.out.println("排序前:" + arrayToString(arr));
bubbleSort(arr);
System.out.println("排序前:" + arrayToString(arr));
}
public static void output(int[] arr) {
for(int i = 0; i < arr.length;i++) {
System.out.print(" "+arr[i]);
}
System.out.println("");
}
public static String arrayToString(int[] arr){
String result = "";
result += "[";
for (int i = 0; i< arr.length;i++){
if(i == arr.length - 1) {
result += arr[i];
}else{
result += arr[i]+",";
}
}
result += "]";
return result;
}
public static int add(int[] arr) {
int sum = 0;
for(int i = 0;i< arr.length;i++) {
sum += arr[i];
}
return sum;
}
public static int maxNum(int[] arr) {
int sum = arr[0];
for(int i = 0;i < arr.length-1;i++) {
if(arr[i] > arr[i+1]) {
sum = arr[i];
}else {
sum = arr[i+1];
}
}
return sum;
}
public static void reverseArray(int[] arr) {
for(int i = 0; i < arr.length/2; i++) {
int temp = 0;
temp = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = temp;
}
}
public static boolean baiscSearch(int[] arr,int num) {
boolean flag = false;
for(int i = 0; i < arr.length;i++) {
if(arr[i] == num) {
flag = true;
break;
}
}
return flag;
}
public static int isContainsNum(int[] arr,int num) {
int index = -1;
for(int i = 0; i < arr.length;i++) {
if(arr[i] == num) {
index = i;
break;
}
}
return index;
}
public static void bubbleSort(int[] arr) {
for(int j = 0; j < arr.length - 1; j++) {
for(int i = 0 ; i < arr.length-1-j; i++) {
if(arr[i] > arr[i + 1]) {
int temp = 0;
temp = arr[i];
arr[i] = arr[i + 1];
arr[i+1] = temp;
}
}
}
}
}