java数学简单实例

找出一组正整数中的最大值及其最大位

import java.util.Scanner;
public class Main { 
   public static void main (String[] args) { 
      Scanner sc = new Scanner(System.in);
        int max=0;
        while(sc.hasNextInt()){ 
           int num=sc.nextInt();
            if(max<num){
              max=num; 
           }
    }
    System.out.println( "最大值 "+ max);
    int max_n=max%10;
    while(max!=0){ 
       if(max_n<max%10){
             max_n=max%10;
        }max/=10;
    }    System.out.print("最大位 "+max_n);    
}
}

将一整个正整数的所有位重新排序，组成一个最大数

import java.util.Scanner;
public class Main{
    public static void main(String[] args ){
        Scanner sc = new Scanner(System.in);
        String imput =sc.next();
        String arr[] = imput.split("");
        int[] a = new int[arr.length];
        sc.close();
        for(int i = 0; i<a.length; i++) {
        	a[i] = Integer.parseInt(arr[i]);
        }
        int temp;
        for(int i = 0; i<a.length-1; i++){
            for(int j = i+1; j<a.length; j++){
            if(a[i]<a[j]){
                temp = a[j];
                a[j] = a[i];
                a[i] = temp;
            }
            }
        }
        for(int i = 0; i<a.length; i++){
            System.out.print(a[i]);
        }
        }
    }

判断一个数是否是“相邻位不重复数”

import java.util.Scanner;
public class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
   int num = sc.nextInt();
   int count=0;
   int n = num;
   while(n !=0){
       count ++;
       n /= 10;
   }
   int abc[] = new int[count];
   for(int i=0; i<count; i++) {
   	abc[i] = num%10;
   	num /= 10;
   }
   boolean flag = false;
   for(int j=0; j<abc.length-1; j++) {
   	if(abc[j] == abc[j+1]) {
   	flag = true;
   	break;
   	}	  
   }
   if(!flag) {
   	System.out.println(true);
   }
   else {
   	System.out.println(false);
   }
  }
}

学生成绩类排序

import java.util.TreeSet;
import java.util.Scanner;
public class Main{
    public static void main(String [] args){
        Scanner sc = new Scanner(System.in);
        TreeSet<Student> stus = new TreeSet<>();
        while(sc.hasNext()){
            String name = sc.next();
            String id = sc.next();
            int chinese = sc.nextInt();
            int math = sc.nextInt();
            int english = sc.nextInt();            
            
            
           stus.add(new Student(name,id,chinese,math,english));
        }
        sc.close();
        for(Student stu :stus) {
        	System.out.println(stu);
        }
        
    }
}
class Student implements Comparable<Student>{
    private String name;
    private String id;
    private int chinese;
    private int math;
    private int english;
    
    public Student() {
}
    public Student(String name, String id,int chinese ,int math, int english) {
        this.name = name;
        this.id = id;
        this.chinese = chinese;
        this.math = math;
        this.english = english;
}
    public int getSum(){
        return chinese+math+english;
    }
    public int getChinese() {
    	return chinese;
    }
    public int getMath() {
    	return math;
    }
    public int getEnglish() {
    	return english;
    }
    public String getId() {
    	return id;
    }
    
    public String toString(){
        return name+ ", "+id+", "+getSum()+", "+chinese+", "
            +math+", "+english;
    }
    
    public int compareTo(Student o) {
    	Student stu = (Student) o;
        int num1 = stu.getSum() - this.getSum();
        int num2 = (num1==0? stu.getChinese() - this.getChinese()   : num1);
        int num3 = (num2==0? stu.getMath() - this.getMath()         : num2);
        int num4 = (num3==0? stu.getEnglish() - this.getEnglish()   : num3);
        int num5 = (num4==0? this.id.compareTo(stu.getId())        : num4);	
return num5;
}
}

使用集合存储和遍历

import java.util.ArrayList;
import java.util.Scanner;
public class Main{
    public static void main(String [] args){
        Scanner sc = new Scanner(System.in);
        ArrayList<Student> list = new ArrayList<>();
        while(sc.hasNext()){
            String name = sc.next();
            String id = sc.next();
            int chinese = sc.nextInt();
            int math = sc.nextInt();
            int english = sc.nextInt();
            
            Student stu = new Student(name,id,chinese,math,english); 
            list.add(stu);
        }
        for(int i=0;i<list.size();i++){
            System.out.println(list.get(i));
        }
    }
}
class Student {
    private String name;
    private String id;
    private int chinese;
    private int math;
    private int english;
    
    public Student() {
}
    public Student(String name, String id,int chinese ,int math, int english) {
        this.name = name;
        this.id = id;
        this.chinese = chinese;
        this.math = math;
        this.english = english;
}
    public int getSum(){
        return chinese+math+english;
    }
    public String toString(){
        return name+ ", "+id+", "+getSum()+", "+chinese+", "
            +math+", "+english;
    }
}

找一组数据中最大的"相邻位不重复数"

import java.util.Scanner;
public class Main{
    public static void main(String [] args){
        Scanner sc = new Scanner(System.in);
        int max = 0;
        lable:while(sc.hasNextInt()){
            int num = sc.nextInt();
            char [] ch = String.valueOf(num).toCharArray();
            for(int i=0;i<ch.length-1;i++)
                if(ch[i] == ch[i+1]){
                    continue lable;
                }
                if(max<num){
                    max = num;
                }
        }
        System.out.println(max);
    }
}