zoukankan      html  css  js  c++  java
  • 【练习】购物车程序

    # -*- coding:utf8 -*-
    # Author: Wsq 2018.03.20
    # 功能要求:
    # 1、启动程序后,输入用户名密码后,让用户输入工资,然后打印商品列表
    # 2、允许用户根据商品编号购买商品
    # 3、用户选择商品后,检测余额是否够,够就直接扣款,不够就提醒
    # 4、可随时退出,退出时,打印已购买商品和余额
    # 5、在用户使用过程中, 关键输出,如余额,商品已加入购物车等消息,需高亮显示

    menu = [
    {"name": "电脑", "price": 1999},
    {"name": "鼠标", "price": 10},
    {"name": "键盘", "price": 20},
    {"name": "手机", "price": 998},
    ]
    name=input('请输入账号:')
    key=input('请输入密码:')
    salary=int(input('请输入工资:'))
    # if salary < 10:
    # print('33[0;32;40m商品序号错误/余额不足33[0m')
    shopping=[]
    while salary >= 10:
    print('==============可选商品=============')
    for index, items in enumerate(menu):
    print(index, items)
    n = int(input('请输入商品序号:'))
    if n == 10086:
    if shopping==[]:
    break
    else:
    print(shopping)
    if salary>0:
    if n==10086:
    break
    elif n<len(menu):
    shopping.append(menu[n])
    print('33[0;32;40m已经购买的物品:33[0m',shopping)
    salary1 = menu[n]['price']
    salary = salary - salary1
    print('33[0;32;40m本次购买物品为:33[0m',menu[n]['name'],'价格:',salary1)
    print('33[0;32;40m余额为:33[0m',salary)
    else:
    print('33[0;32;40m商品序号错误/余额不足33[0m')
    print('33[0;32;40m您的余额不足,请充值。33[0m')
  • 相关阅读:
    124. Binary Tree Maximum Path Sum
    99. Recover Binary Search Tree
    255. Verify Preorder Sequence in Binary Search Tree
    [LeetCode] 79. Word Search Java
    [LeetCode] 78. Subsets Java
    [LeetCode] 77. Combinations Java
    [LeetCode] 52. N-Queens II Java
    [LeetCode] 51. N-Queens Java
    [LeetCode] 47. Permutations II Java
    [LeetCode] 46. Permutations Java
  • 原文地址:https://www.cnblogs.com/play-chess/p/8618733.html
Copyright © 2011-2022 走看看