zoukankan      html  css  js  c++  java
  • 输入三个数值,输出其中的最大值和最小值

    方法一:
    print("Number1、Number2、Number3只能输入3个数字")

    number1 = float(input("Number1= "))
    number2 = float(input("Nnmber2= "))
    number3 = float(input("Number3= "))

    if number1 >= number2 >= number3:
    print("最大值为:",number1)
    print("最小值为:",number3)
    elif number3 >= number1 >= number2:
    print("最大值为:",number3)
    print("最小值为:",number2)
    elif number1 >= number3 >= number2:
    print("最大值为:",number1)
    print("最小值为:",number2)
    elif number2 >= number1 >= number3:
    print("最大值为:",number2)
    print("最小值为:",number3)
    elif number3 >= number2 >= number1:
    print("最大值为:",number3)
    print("最小值为:",number1)
    else:
    print("最大值为:",number2)
    print("最小值为:",number1)

    方法二:
    print("Number1、Number2、Number3只能输入3个数字")

    number1 = float(input("Number1= "))
    number2 = float(input("Nnmber2= "))
    number3 = float(input("Number3= "))
    max_number = 0

    if number1 >= number2:
    max_number = number1
    if number3 >= max_number:
    print("最大值为:",number3)
    else:
    print("最大值为:",max_number)
    else:
    max_number = number2
    if number3 >= max_number:
    print("最大值为:", number3)
    else:
    print("最大值为:", max_number)
  • 相关阅读:
    trie树
    基数排序
    CF724E Goods transportation 最小割 DP
    [CQOI2009]跳舞 网络流
    NOIP2018爆零记
    斜率优化
    CF311B Cats Transport 斜率优化DP
    逆元
    卡特兰数
    【BZOJ】【1565】【NOI2009】PVZ 植物大战僵尸
  • 原文地址:https://www.cnblogs.com/xiaobinglife/p/8929709.html
Copyright © 2011-2022 走看看