码迷,mamicode.com
首页 >  
搜索关键字:price    ( 2479个结果
水果进出存储
create database fruitgouse fruitgocreate table Fruit( Ids varchar(50) primary key, [Name] varchar(50) not null, Price decimal(8,2), Source varchar(50)...
分类:其他好文   时间:2015-04-27 21:20:43    阅读次数:147
Mysql跨表更新 多表update sql语句总结
UPDATE product p, productPrice pp SET pp.price = pp.price * 0.8 WHERE p.productId = pp.productId
分类:数据库   时间:2015-04-27 16:46:31    阅读次数:159
价格区间不能自由修改的问题
我用的模板是BigSale,其他的也没太大差别,先在后台里把价格区间设置出来,在模板文件夹里找出category.dwt然后在里面找到如下:<divclass="screeBox"><strong>{$lang.price}:</strong><!--{foreachfrom=$price_gradeitem=grade}--><!--{if$grade..
分类:其他好文   时间:2015-04-27 15:28:10    阅读次数:131
进销存存储过程
create database Fruitcreate table fruit(Ids varchar(50),Name varchar(50),Price decimal(18,2),Source varchar(50),Stack int,Numbers int,Image varchar(50...
分类:其他好文   时间:2015-04-27 12:53:00    阅读次数:166
leetcode || 121、Best Time to Buy and Sell Stock
problem: Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one ...
分类:其他好文   时间:2015-04-27 11:25:03    阅读次数:120
leetcode || 122、Best Time to Buy and Sell Stock II
problem: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as ...
分类:其他好文   时间:2015-04-27 11:22:20    阅读次数:123
leetcode || 123、Best Time to Buy and Sell Stock III
problem: Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions...
分类:其他好文   时间:2015-04-27 11:18:37    阅读次数:134
取出重复的客运车班次,两个字段的值互换视为重复值
取出重复的客运车班次SELECT CID, FROM_CITY, TO_CITY, TICKET_PRICE FROM CITYWHERE CID IN (SELECT DISTINCT FIRST_VALUE(CCID) OVER(PARTITION BY FROM_CITY, TO_CITY O...
分类:其他好文   时间:2015-04-25 00:06:41    阅读次数:125
利用链表实现简单的t停车场信息管理系统
#include #include #include #define MAX 2//车库容量#define price 0.05//每车每分钟费用typedef struct time//时间结点{ int hour; int min;}Time;typedef struct node{ char ...
分类:其他好文   时间:2015-04-24 20:58:36    阅读次数:240
HDU ACM 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活->多重背包问题
分析:多重背包问题。这里直接转换为01背包,为使用二进制。 #include using namespace std; int price[101]; int weight[101]; int number[101]; int dp[101]; int main() { int C,n,m; int i,j,k; cin>>C; while(C--) { cin>>n...
分类:其他好文   时间:2015-04-24 19:19:37    阅读次数:132
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!