https://leetcode-cn.com/problems/shu-zhi-de-zheng-shu-ci-fang-lcof
https://leetcode-cn.com/problems/er-jin-zhi-zhong-1de-ge-shu-lcof
int型的回文数
https://leetcode-cn.com/problems/palindrome-number
https://leetcode-cn.com/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof
https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/
要点:两端开始“探测”,设置的基准数是最左边的数,所以需要让哨兵j先出动, 分治想法
12
java.lang.Object java.lang.String
https://leetcode-cn.com/problems/climbing-stairs
动态规划
https://leetcode-cn.com/problems/jian-sheng-zi-ii-lcof
大数越界问题
给你一根长度为 n 的绳子,请把绳子剪成整数长度的 m 段(m、n都是整数,n>1并且m>1),求最大乘积
n
m
https://leetcode-cn.com/problems/jian-sheng-zi-lcof/
fallenk
研究僧
Hangzhou, ZJU
Entradas
118
Categorias
19
Etiquetas
44
Update your browser to view this website correctly. Update my browser now
×