zoukankan      html  css  js  c++  java
  • while循环01(猜年龄)终止运行语句

     1 age = 50
     2 #user_input_age = int(input("Age is:"))
     3 
     4 flag = True
     5 while flag:
     6     user_input_age = int(input("Age is :"))
     7     if user_input_age == age:
     8         print("Yes")
     9         flag = False
    10     elif user_input_age > age:
    11         print("Is bigger")
    12     else:
    13         print("Is smaller")
    14 print("end")

    终止死循环语句1:while语句循环小节,可以将True进行变量,才可以进行变换,让True变成Flalse。

    age = 50
    #user_input_age = int(input("Age is:"))
    
    #flag = True
    while True:
        user_input_age = int(input("Age is :"))
        if user_input_age == age:
            print("Yes")
            break
        elif user_input_age > age:
            print("Is bigger")
        else:
            print("Is smaller")
    print("end")

    终止死循环语句2:不用变量直接上,用break语句直接结算循环。

     1 # continus
     2 
     3 num = 1
     4 
     5 while num <= 10:
     6     num += 1
     7     if num == 3:
     8         continue
     9     print(num)
    10 else:
    11     print("This is else statement")

    单次循环终止:continus 终止循环中的一次。

    num1 = 0
    
    while num1<=5:
        print(num1,end="_")
        num2 = 0
        while num2<=7:
            print(num2,end="-")
            num2+=1
        num1+=1
        print() #等价于 print(end="
    ")
    0_0-1-2-3-4-5-6-7-
    1_0-1-2-3-4-5-6-7-
    2_0-1-2-3-4-5-6-7-
    3_0-1-2-3-4-5-6-7-
    4_0-1-2-3-4-5-6-7-
    5_0-1-2-3-4-5-6-7-
    默认换行
    制作乘法表
  • 相关阅读:
    二叉排序树的最低公共祖先
    [jobdu]树中两个结点的最低公共祖先
    [jobdu]用两个栈实现队列
    [leetcode]Balanced Binary Tree
    [jobdu]从尾到头打印链表
    [leetcode]Flatten Binary Tree to Linked List
    [leetcode]Unique Binary Search Trees
    hdu 4059
    hdu 3972 1 M possible
    CF 317D Game with Powers
  • 原文地址:https://www.cnblogs.com/fate2048/p/8443500.html
Copyright © 2011-2022 走看看