文件名称:用c实现的商品货架算法
介绍说明--下载内容均来自于网络,请自行研究使用
问题描述: 假设一个商店,它有一个货架和一个仓库,当货架上的商品数量少于一定的数目时,从仓库运一定数量的商品摆到货架上,当仓库里的商品的数量少于一定的数目时,购买商品把仓库填满,商品的出售要按照商品的生产日期来,快要过期的商品要先出售。 解决问题的方法: 用了两个栈和 一个队列,把队列当作仓库,用一个栈作为货架,把另一个栈当作临时的存储箱。当要往货架上添商品时,先把作为货架的栈中的元素全都压到作为存储箱的栈中,再把仓库中的元素压到存储箱中,然后再把存储箱中的所有元素都压到货架上,这样,就能保证快要过期的商品先被出售。-Problem descr iption : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then storage box has all the elements of the pressure arrived shelve
(系统自动生成,下载前可以参看下载内容)
下载文件列表
商品货架
........\LINK3.h
........\lqueue.h
........\LSTACK1.H
........\zn3.CPP
........\LINK3.h
........\lqueue.h
........\LSTACK1.H
........\zn3.CPP