LC29题，help康康哪写错了

你要不要把代码给我让我运行一下 你这是在干啥

public class demo29 {
    public static void main(String[] args) {
        System.out.println(solution(10, 3));
        System.out.println(solution(-10, -2));
        System.out.println(solution(10, -2));
    }
    public static int solution(int dividend, int divisor) {
        int num = 0;
        if (divisor > 0 && dividend >0) {
            while ((dividend - divisor) >= 0) {
                dividend -= divisor;
                num++;
            }
        }
        else {
            if(Math.min(dividend,divisor) < 0 && Math.max(dividend,divisor) > 0) {//那么divisor是负数，dividend是整数
                while ((dividend + divisor) <= 0) { //一正一负
                    dividend += divisor;
                    num++;
                }
            }
            else {
                while ((dividend - divisor) <= 0) {  //两个都是负数时
                    dividend -= divisor;
                    num++;
                }
            }
    }
         return num;}
}

https://leetcode-cn.com/problems/divide-two-integers/

发不了题目，leetcode好像有限制

public class demo29 {
    public static void main(String[] args) {
        System.out.println(solution(10, 3));
        System.out.println(solution(-10, -2));
        System.out.println(solution(10, -2));
    }
    public static int solution(int dividend, int divisor) {
        int num = 0;
        if (divisor > 0 && dividend >0) {
            while ((dividend - divisor) >= 0) {
                dividend -= divisor;
                num++;
            }
        }
        else {
            if(Math.min(dividend,divisor) < 0 && Math.max(dividend,divisor) > 0) {//那么divisor是负数，dividend是整数
                while ((dividend + divisor) >= 0) { //一正一负   10 + -2 == 8
                    dividend += divisor;
                    num--;
                }
                return num;
            }
            else {
                while ((dividend - divisor) <= 0) {  //两个都是负数时
                    dividend -= divisor;
                    num++;
                }
            }
    }
         return num;}
}