每日编程练习（打卡第二天）

小白啥都要懂

于 2022-03-15 16:46:56 发布

阅读量194

点赞数

分类专栏： java 文章标签： java

本文链接：https://blog.csdn.net/AiTTTTTT/article/details/123498673

版权

java 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

这是每日编程练习的第二天，涵盖了判断回文数、计算数字各位之和、打印图形以及求平方根等基础编程题，旨在提升编程技能。

摘要由CSDN通过智能技术生成

1.判断回文数：

import java.util.Scanner;

public class HuiWenZhengShu {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("请输入一个数字：");
        int num = sc.nextInt();
        if(isPaildrome(num)){
            System.out.println("是回文数");
        }else{
            System.out.println("不是回文数");
        }
    }
    public static boolean isPildrome(int num){
        return reverse(num) == num;
    }
    public static int reverse(int sum){
        int sum = 0;
        while(true){
            sum = sum * 10 + num % 10;
            num /= 10;
            if(num == 0){
                return sum;
            }
        }
    }
}

2.求数字各项和：

import java.util.Scanner;

public class ZiChuan01 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.pritln
        int num = sc.nextInt();
        int sum = sumDigtal(num);
        System.out.println(num);
    }
    public static int sumDigtal(int n){
        int sum = 0;
        while(true){
            sum += n % 10;
            n /= 10;
            if(n == 0){
                return sum;
            }
        }
    }
}

3.打印图形：

import java.util.Scanner;

public class PrintTuXing {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("请输入行数：");
        displayPaattern(scanner.nextInt());
    }

    private static void displayPaattern(int line) {
        for (int i = 1; i <= line; i++){
            for (int k = 1; k <= line - i; k++){
                System.out.print("  ");
            }
            for (int j = i; j >= 1; j--){
                System.out.print(j + " ");
            }
            System.out.println();
        }
    }
}

4.平方根：

public class PingFangGen {
    public static void main(String[] args) {
        System.out.println(sqrt(9));
    }
    public static double sqrt(long n){
        double lastGuess = 1;
        double nextGuess = (lastGuess + n / lastGuess) / 2;
        while (true){
            if (Math.abs(nextGuess - lastGuess) < 0.0000001){
                return nextGuess;
            }
            lastGuess = nextGuess;
            nextGuess = (lastGuess + n / lastGuess) / 2;
        }
    }
}