提供2个正数，要求不能用除法，请计算出商和余数

public static int[] reDiv(int a,int b){
    //不能用除法，要求计算出商 和 余数
    int [] arr = new int[2];
    int quotient = 0;
    int remainder = 0;
    while(a>=b){
        a = a-b;
        quotient++;
    }
    remainder = a;
    arr[0] = quotient;
    arr[1] = remainder;
    return arr;
}