搜索资源列表
0-1beibao
- 01背包问题题目 有N件物品和一个容量为V的背包。第i件物品的费用是c[i],价值是w[i]。求解将哪些物品装入背包...但它却是另一个重要的背包问题P02最简捷的解决方案,故学习只用一维数组解01背包问题是十分必要的。
delRepeat
- 去除文件中的重复行。 先将文件内容读入一buffer,按行拆分，每行数据只取\t之前的部分。然后用二分直接插入法将不重复的字符串放入一二维数组。-Remove duplicate rows from the file. Content of the document read into a first buffer, split by row, each row of data just take \ t the previous section. Then two minutes dire
delRepeat
- 分别用数组和链表方式实现去除文件中的重复行。先将文件内容读入一buffer,按行拆分，每行数据只取\t之前的部分。然后用二分直接插入法将不重复的字符串放入一二维数组或动态链表中。 -Respectively, be achieved using arrays and linked the file to remove duplicate rows. Content of the document read into a first buffer, split by row, each row
Dij1DArray
- dijstra一维数组，速度比二位数组快-dijstra one-dimensional array, the speed is faster than the two-digit group
READFILE
- 文件读取，从text中读取一维数组，将其赋给定义的指针变量，进行后续处理-File to read, read one-dimensional array txt, which was assigned to the defined pointer variable, for subsequent processing