- 博客(2)
- 收藏
- 关注
RSS订阅原创 保研面试 英文算法题 临时抱佛脚训练思路系列——搜索专题
专题二 DFS与BFSA1103 Integer FactorizationThe K−P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program to find the K−P factorization of N for any positive integers N, K
2020-09-18 14:11:06
223
原创 保研面试 英文算法题 临时抱佛脚训练思路系列——动态规划
专题一 动态规划A1007 Maximum Subsequence SumGiven a sequence of K integers { N1N_1N1 , N2N_2N2 , …, NKN_KNK }. A continuous subsequence is defined to be { NiN_iNi , Ni+1N_{i+1}Ni+1 , …, NjN_jNj } where 1≤i≤j≤K. The Maximum
2020-09-16 20:10:52
559
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人