用BufferedReader包装后的标准输入流连续输入数字，怎样解决中间的换行符问题

此处是实现键盘输入的数组的七种功能，因为过程中遇到了包装标准输入流之后的连续输入两个数字的问题，特对比了字符转换Character.digit(）和字符串解析Integer.parseInt(）两种方法

package cn.fish_01;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

public class ArrayDemo {
    public static void main(String[] args) throws IOException {
        BufferedReader br1 = new BufferedReader(new InputStreamReader(System.in));
        System.out.println("请输入数组元素的个数");
        int number = Character.digit(br1.read(), 10);
        int[] arr = new int[number];
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String str1 = null;
        int count1 = 0;
        while (true) {
            if(count1 == number) {
                break;
            }
            System.out.println("请输入数组元素");
            if ((str1 = br.readLine()) == null) {
                break;
            }
            arr[count1] = Integer.parseInt(str1.trim());
            count1++;

        }
        ArrayFunction.GetConstructot(arr);
        ArrayFunction.foreach();
        while (true) {
            System.out.println("请问您想玩游戏吗，是请输入y，否请输入n");
            Scanner sc = new Scanner(System.in);
            String str2 = sc.nextLine();    
            if (str2.equals("y") || str2.equals("Y")) {
                System.out.println("请输入你想选择的功能");
                System.out.println("1 遍历");
                System.out.println("2 获取最大值");
                System.out.println("3 获取最小值");
                System.out.println("4 排序");
                System.out.println("5 查询");
                System.out.println("6 查找");
                System.out.println("7 逆序");
                //int choice = Character.digit(br.read(), 10);
                int choice = Integer.parseInt(br.readLine());
                System.out.println("结果是：");
                switch (choice) {
                case 1:
                    ArrayFunction.foreach();
                    break;
                case 2:
                    ArrayFunction.getMax();
                    break;
                case 3:
                    ArrayFunction.getMax();
                    break;
                case 4:
                    ArrayFunction.sort();
                    ArrayFunction.foreach();
                    break;
                case 5:
                    //int value = Character.digit(br.read(), 10);
                    int value = Integer.parseInt(br.readLine());
                    ArrayFunction.exit(value);
                    break;
                case 6:
                    //int value2 = Character.digit(br.read(), 10);
                    int value2 = Integer.parseInt(br.readLine());
                    ArrayFunction.find(value2);
                    break;
                case 7:
                    ArrayFunction.reverse();
                    ArrayFunction.foreach();
                    break;
                default:
                    System.out.println("对不起，没有您输入的选项");
                    break;
                }

            } 
            if((str2.equals("n"))||(str2.equals("N"))){
                System.exit(0);
            }
        }

    }
}

package cn.fish_01;

public abstract class ArrayFunction {
    private static int[] arr;

    public ArrayFunction() {

    }

    public static void GetConstructot(int[] arr1) {
        arr = arr1;

    }

    public static void foreach() {
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

    public static int getMax() {
        for (int i : arr) {
            if (arr[0] < i) {
                arr[0] = i;
            }
        }
        return arr[0];
    }

    public static int getMin() {
        for (int i : arr) {
            if (arr[0] > i) {
                arr[0] = i;
            }
        }
        return arr[0];
    }

    public static void sort() {
        for (int x = 0; x < arr.length - 1; x++) {
            for (int y = 0; y < arr.length - 1 - x; y++) {
                if (arr[y] > arr[y + 1]) {
                    int temp;
                    temp = arr[y];
                    arr[y] = arr[y + 1];
                    arr[y + 1] = temp;
                }
            }

        }
    }

    public static boolean exit(int value) {
        for (int i : arr) {
            if (i == value) {
                return true;
            }
        }
        return false;
    }

    public static int find(int value) {
        int count = 0;
        for (int i : arr) {
            if (i == value) {
                return count;

            }
        }
        return -1;
    }

    public static void reverse() {
        for(int i=0;i<arr.length/2;i++) {
            int temp = arr[i];
            arr[i] = arr[arr.length- 1-i];
            arr[arr.length-1-i] = temp;
        }
    }
}