Java算法实现蜗牛援井(井深、攀爬距离、下滑距离)

最新推荐文章于 2023-03-06 05:13:31 发布

WanAkiko.

最新推荐文章于 2023-03-06 05:13:31 发布

阅读量2.1k

点赞数

分类专栏：化典成籍 - Java 文章标签： java 经验分享

©️ 2020 WanAkiko.

本文链接：https://blog.csdn.net/qq_44965393/article/details/107087911

版权

化典成籍 - Java 专栏收录该内容

130 篇文章 6 订阅

订阅专栏

package extraPractice;

import java.util.Scanner;

public class ASnail {

	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {

		System.out.print("请输入井深：");
		double wellDepth = sc.nextDouble();
		System.out.print("请输入蜗牛白天的攀爬距离：");
		double climb = sc.nextDouble();
		System.out.print("请输入蜗牛夜晚的下滑距离：");
		double glide = sc.nextDouble();
		int numOfDays = 0; // 天数
		double climbDistance = 0.0; // 总爬行距离
		for (int i = 1; i >= 0; i++) {
			climbDistance += climb;
			if (climbDistance >= wellDepth) {
				numOfDays = i;
				break;
			}
			climbDistance -= glide;
		}
		System.out.println("提示：蜗牛需要" + numOfDays + "天才能爬到井口！");

	}

}