java入门基础案例

1、计算两个数的和并输出结果

public class AddNumbers {
    public static void main(String[] args) {
        int num1 = 5;
        int num2 = 10;
        int sum = num1 + num2;
        System.out.println("两个数的和为：" + sum);
    }
}
 

2、判断一个数是否为素数

public class PrimeNumber {
    public static void main(String[] args) {
        int num = 17;
        boolean isPrime = true;
        for (int i = 2; i <= num / 2; i++) {
            if (num % i == 0) {
                isPrime = false;
                break;
            }
        }
        if (isPrime) {
            System.out.println(num + "是素数");
        } else {
            System.out.println(num + "不是素数");
        }
    }
}
 

3、输出斐波那契数列指定长度的序列

public class FibonacciSeries {
    public static void main(String[] args) {
        int length = 10;
        int[] fibonacci = new int[length];
        fibonacci[0] = 0;
        fibonacci[1] = 1;
        for (int i = 2; i < length; i++) {
            fibonacci[i] = fibonacci[i - 1] + fibonacci[i - 2];
        }
        System.out.println("斐波那契数列前" + length + "个数为：");
        for (int num : fibonacci) {
            System.out.print(num + " ");
        }
    }
}
 

4、判断一个字符串是否为回文字符串

public class Palindrome {
    public static void main(String[] args) {
        String str = "level";
        String reverse = "";
        for (int i = str.length() - 1; i >= 0; i--) {
            reverse += str.charAt(i);
        }
        if (str.equals(reverse)) {
            System.out.println(str + "是回文字符串");
        } else {
            System.out.println(str + "不是回文字符串");
        }
    }
}
 

5、使用递归计算阶乘

public class Factorial {
    public static void main(String[] args) {
        int num = 5;
        int fact = factorial(num);
        System.out.println(num + "的阶乘为：" + fact);
    }
    
    static int factorial(int n) {
        if (n == 0) {
            return 1;
        } else {
            return n * factorial(n - 1);
        }
    }
}
 

6、打印九九乘法表

public class MultiplicationTable {
    public static void main(String[] args) {
        for (int i = 1; i <= 9; i++) {
            for (int j = 1; j <= i; j++) {
                System.out.print(j + " × " + i + " = " + (i * j) + " ");
            }
            System.out.println();
        }
    }
}
 

7、判断一个数是否为回文数

public class PalindromeNumber {
    public static void main(String[] args) {
        int num = 121;
        int originalNum = num;
        int reverseNum = 0;
        while (num != 0) {
            reverseNum = reverseNum * 10 + num % 10;
            num /= 10;
        }
        if (originalNum == reverseNum) {
            System.out.println(originalNum + "是回文数");
        } else {
            System.out.println(originalNum + "不是回文数");
        }
    }
}
 

8、找出数组中的最大元素

public class MaximumElement {
    public static void main(String[] args) {
        int[] arr = {10, 5, 8, 20, 15};
        int max = arr[0];
        for (int i = 1; i < arr.length; i++) {
            if (arr[i] > max) {
                max = arr[i];
            }
        }
        System.out.println("数组中的最大元素为：" + max);
    }
}
 

9、判断一个字符串是否为有效的数字

public class ValidNumber {
    public static void main(String[] args) {
        String str = "123.45";
        try {
            Double.parseDouble(str);
            System.out.println(str + "是一个有效的数字");
        } catch (NumberFormatException e) {
            System.out.println(str + "不是一个有效的数字");
        }
    }
}
 

10、实现二分查找算法

public class BinarySearch {
    public static void main(String[] args) {
        int[] arr = {10, 20, 30, 40, 50, 60};
        int target = 40;
        int low = 0;
        int high = arr.length - 1;
        int index = -1;
        while (low <= high) {
            int mid = (low + high) / 2;
            if (arr[mid] == target) {
                index = mid;
                break;
            } else if (arr[mid] > target) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }
        if (index != -1) {
            System.out.println("目标元素" + target + "在数组中的索引为：" + index);
        } else {
            System.out.println("目标元素" + target + "不存在于数组中");
        }
    }
}
 

快拿去练练吧