4 Star 0 Fork 0

JLU241/MarketManagement

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
backup.txt 1.08 KB
一键复制 编辑 原始数据 按行查看 历史
黄一桐 提交于 2022-04-12 21:03 . 优化代码风格
/*
if (num == 1)
{
goods_idx = GetGoodsNum(p->goods.name);
variety_idx = GetVarietyNum(goods_idx, p->variety.name);
supplier_idx = GetSupplierNum(p->supplier.name);
if (del_num < p->num)
{
p->num = p->num - del_num;
}
else
{
head = p->next;
free(p);
}
}
else if (num == i)
{
for (int j = 1; j < num - 1; j++)
{
q = q->next;
}
p = q->next;
int goods_idx = 0, variety_idx = 0, supplier_idx = 0;
if (p != NULL)
{
goods_idx = GetGoodsNum(p->goods.name);
variety_idx = GetVarietyNum(goods_idx, p->variety.name);
supplier_idx = GetSupplierNum(p->supplier.name);
}
if (p != NULL && p->num < del_num)
p->num = p->num - del_num;
else
{
q->next = NULL;
free(p);
}
}
else if (num > 1 && num < i)
{
for (int j = 1; j < num - 1; j++)
{
q = q->next;
}
p = q->next;
goods_idx = GetGoodsNum(p->goods.name);
variety_idx = GetVarietyNum(goods_idx, p->variety.name);
supplier_idx = GetSupplierNum(p->supplier.name);
if (p->num < del_num)
p->num = p->num - del_num;
else
{
q->next = p->next;
p = p->next;
}
}
*/
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C
1
https://gitee.com/jlu241/cproject.git
git@gitee.com:jlu241/cproject.git
jlu241
cproject
MarketManagement
master

搜索帮助