Instantly share code, notes, and snippets.

# time-rivertime-river

• Sort options
Last active May 7, 2019
consideration of permutations.
View permutations.py
 ''' link - https://leetcode.com/problems/permutations/ problem: Given a collection of distinct integers, return all possible permutations. Example: Input: [1,2,3] Output: [
Created Jul 31, 2018

View multiple_pack-2.cpp
 /* * 背包九讲之多重背包 一维数组 * from: http://acm.hdu.edu.cn/showproblem.php?pid=2191 * reference: https://blog.csdn.net/hellobabygogo3/article/details/7993547 */ #include using namespace std;
Created Jul 31, 2018

View multiple_pack-1.cpp
 /* * 背包九讲之多重背包 二维数组 * from: http://acm.hdu.edu.cn/showproblem.php?pid=2191 * reference: https://blog.csdn.net/hellobabygogo3/article/details/7993547 */ #include using namespace std;
Created Jul 31, 2018

View complete_pack-2.cpp
 /* * 背包九讲之完全背包 恰好装满 滚动数组 * from: http://acm.hdu.edu.cn/showproblem.php?pid=1114 * reference: https://blog.csdn.net/liujc_/article/details/44003167 */ #include #define PMAX 1000000001
Created Jul 31, 2018

View complete_pack-1.cpp
 /* * 背包九讲之完全背包 恰好装满 二维数组 * from: http://acm.hdu.edu.cn/showproblem.php?pid=1114 * reference: https://blog.csdn.net/liujc_/article/details/44003167 */ #include #define NMAX 500 #define PMAX 1000000001
Last active Jul 31, 2018

View one_zero_pack-2.cpp
 /* * 背包九讲之01背包 滚动数组 * from: http://www.hawstein.com/posts/dp-knapsack.html */ #include using namespace std; #define MAXN 1000
Last active Jul 31, 2018

View one_zero_pack-1.cpp
 /* * 背包九讲之01背包 二维数组 * from: http://www.hawstein.com/posts/dp-knapsack.html */ #include using namespace std; #define MAXN 1000
Last active Jun 6, 2018