牛客网--刷题

 2022-6-29

1.计算糖果：

描述：输入4个整数，分别为：A-B；B-C；A+B，B+C，计算A、B、C分别为？

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
     Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int d = sc.nextInt();
        int A = (a + c)/2;
        int B1 = (b + d)/2;
        int B2 = (c - a)/2;
        int C = (d - b)/2;
        if(B1== B2){
            System.out.println(A + " " + B1 + " " + C);
        }else{
            System.out.println("No");
        }
    }
        
}

2.进制转换

描述：将十进制数M转换为N进制数；

import java.util.Scanner;
import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int M = sc.nextInt();
        int N = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        String table = "0123456789ABCDEF";
        boolean flg = false;
        // M== 0
        if(M == 0){
            System.out.println("0");
            return;
        }
        //M 负数
        if(M < 0){
            M = -M;
            flg = true;
        }
        while(M != 0){
            sb.append(table.charAt(M % N));
            M = M / N;
        }
        if(flg == true){
            sb.append("-");
        }
        sb.reverse();
        System.out.println(sb);
    }
}

2022-6-30

3.字符串中找出连续最长的数字串

import java.util.*;
public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			String str = sc.nextLine();
			System.out.println(numberStr(str));
		}
	}
	public static String numberStr(String str){
		int max = 0,count = 0,end = 0;
		for(int i = 0;i < str.length();i++){
			if(str.charAt(i) >= '0' && str.charAt(i) <= '9'){
				count++;
				if(max < count){
					max = count;
					end = i;
				}
			}else{
				count = 0;
			}
		}
		return str.substring(end - max + 1,end + 1);
		
    }
}

4.数组中出现次数超过一半的数字

public class MoreHalfNum {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 3, 3, 3, 3, 3};
        System.out.println(MoreHalfNum.moreHalfNum(arr));
    }
    public static int moreHalfNum(int[] arr) {
        if (arr == null || arr.length < 1) return 0;
        int current = arr[0];//当前位置元素
        int flag = 1;//初始值1
        for (int i = 1; i < arr.length; i++) {
            if (flag > 0) {
                if (current == arr[i]) flag++;//遇到相等的元素flag就++
                else flag--;
            } else {
                current = arr[i];//当flag为0的时候，current重新设定为当前遍历到的值
                flag = 1;
            }
        }
        //如果这个数是存在的，那么其实直接返回current就行
        if (flag>=arr.length/2){
            return current;//最后current中存储的就是出现次数超过⌊n/2⌋的数字
        }
        return 0;
        
    }
}