藍橋杯_基礎_數列特徵+查找整數+楊輝三角形

數列特徵

import java.util.*;
// ArrayList可進行排序操作
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        ArrayList<Integer> list = new ArrayList<Integer>();
        int n = sc.nextInt();
        for(int i=0;i<n;i++)
            list.add(sc.nextInt());
        Collections.sort(list);
        System.out.println(list.get(list.size()-1));
        System.out.println(list.get(0));
        int x = 0;
        for(int i:list)
            x += i;
        System.out.println(x);
    }
}

查找整數

import java.util.*;
// 設置一個標識符作爲返回-1的標誌
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
        int[]a = new int[n];
		for(int i=0;i<n;i++)
			a[i] = sc.nextInt();
		int s = sc.nextInt();
		int num = 0;
		boolean flag = true;
                for(int i=0;i<n;i++)
			if(s == a[i]){
				flag = false;
				System.out.println(i+1);
				break;
				}
			if(flag)
			        System.out.println(-1);
        
    }
}

楊輝三角形

import java.util.*;
// 需先尋找規律 再預設前兩排的值 從第三排開始
public class Main {
    public static void main(String[] args) {
        int n = new Scanner(System.in).nextInt();
        int[] a = null;
        System.out.println(1);
        for(int i=2;i<=n;i++){
            int[] s = new int[i];
            s[0] =s[i-1] = 1;
            System.out.print("1 ");
            for(int j=1;j<=i-2;j++){
                s[j] = a[j-1]+a[j];
                System.out.print(s[j]+" ");
            }
            System.out.println("1");
            a = s;
        }
    }
}