算法_如何计算兔子回家路径算法-CSDN博客

本文链接：https://blog.csdn.net/weixin_43807628/article/details/103769091

水仙花数
字符串中单词反转 https://www.lintcode.com/problem/reverse-words-in-a-string/description
链表中点使用快慢指针
链表的双指针https://cyc2018.github.io/CS-Notes/#/notes/22.%20%E9%93%BE%E8%A1%A8%E4%B8%AD%E5%80%92%E6%95%B0%E7%AC%AC%20K%20%E4%B8%AA%E7%BB%93%E7%82%B9
最大子数组（子数组指的是连续的）
搜索二维数组 https://www.lintcode.com/problem/search-a-2d-matrix/note
主元素 https://www.cnblogs.com/llllllpppppp/p/7607671.html?tdsourcetag=s_pcqq_aiomsg
合并数组https://blog.csdn.net/javaisnotgood/article/details/80534232
树的层次遍历（注意这题要按层放入list中） https://www.lintcode.com/problem/binary-tree-level-order-traversal/
判断平衡树 https://www.lintcode.com/problem/balanced-binary-tree/
链表划分 https://www.lintcode.com/problem/partition-list/description
删除排序数组中重复数字（双指针）https://www.lintcode.com/problem/remove-duplicates-from-sorted-array/description
删除排序链表中的重复元素 (注意多个重复的时候，指针要移到最后一位相同数值的位置)https://www.lintcode.com/problem/remove-duplicates-from-sorted-list/
最小路径和（dp） https://www.lintcode.com/problem/minimum-path-sum/description
不同的路径（dp）到达矩阵中的某个点可能有上面到或者左边到，所以某点的路径由上面的点和左边的点决定https://www.lintcode.com/problem/unique-paths/description
x的平方根 https://www.lintcode.com/problem/sqrtx/description
二叉树最小深度（区分二叉树最大深度，主要在与对于空边不是叶子） https://www.lintcode.com/problem/minimum-depth-of-binary-tree/description
带最小值操作的栈https://www.lintcode.com/problem/min-stack/description
翻转游戏(注意读懂游戏意思：两个连续+变为-)https://www.lintcode.com/problem/flip-game/
全排列https://www.lintcode.com/problem/permutations/
m个数中选n个进行组合https://mp.csdn.net/postedit/103841195
带重复元素的排列https://www.lintcode.com/problem/permutations-ii/description
交叉字符串（子串匹配和子序列问题大多用动态规划） https://www.cnblogs.com/Tang-tangt/p/8964493.html
最长公共子序列(dp)
最长公共子串（dp）这两个dp[][]的定义不一样https://blog.csdn.net/ggdhs/article/details/90713154
最长不含重复字符子串https://www.cnblogs.com/chsobin/p/10582504.html，https://blog.csdn.net/weixin_38361153/article/details/88925999
插入区间 https://blog.csdn.net/hy971216/article/details/83961468
背包问题（动态规划）https://www.lintcode.com/problem/backpack/description （无价值属性） https://blog.csdn.net/yuzeyuan12/article/details/90665315 （有价值属性）https://blog.csdn.net/xp731574722/article/details/70766804
二叉树最长路径（动态规划）
扔鸡蛋
数字三角形（动态规划）https://www.lintcode.com/problem/triangle/
跳跃游戏（递归，易错）https://www.lintcode.com/problem/jump-game/description
编辑距离（动态规划,两字符串从后往前做变换）https://www.lintcode.com/problem/edit-distance/description http://www.sohu.com/a/338910260_478315 https://www.jianshu.com/p/a617d20162cf
翻转二叉树 https://www.lintcode.com/problem/invert-binary-tree/my-submissions
打劫房屋https://www.lintcode.com/problem/house-robber/description
旋转数组 https://www.lintcode.com/problem/rotate-array/description
搜索旋转排序数组 https://www.lintcode.com/problem/search-in-rotated-sorted-array/description
搜索旋转排序数组 II https://www.lintcode.com/problem/search-in-rotated-sorted-array-ii/description
最长连续序列https://www.lintcode.com/problem/longest-consecutive-sequence/note/207957
单词拆分 I https://www.cnblogs.com/Chsy/p/11751125.html
最长有效括号https://blog.csdn.net/l__ear/article/details/89741370
买卖股票的最佳时机 IIhttps://www.cnblogs.com/xingyunblog/p/8907084.html
接雨水https://www.lintcode.com/problem/trapping-rain-water/description
数组划分https://www.lintcode.com/problem/partition-array/description
组合https://www.lintcode.com/problem/combinations/description
子集https://www.lintcode.com/problem/subsets/description
三数之和https://www.jianshu.com/p/65a5c9ffff7b
四数之和https://blog.csdn.net/hit1110310422/article/details/80934545
n皇后（主要注意判断对角线和同行同列的方法）https://www.lintcode.com/problem/n-queens-ii/description
生成括号https://blog.csdn.net/cumt_cx/article/details/50667100
电话号码组成https://www.lintcode.com/problem/letter-combinations-of-a-phone-number/
二进制中1的个数https://blog.csdn.net/melwx/article/details/88356932
判断一个数是否是2的幂次方
计算2的n次方https://blog.csdn.net/zxdspaopao/article/details/84962730
序列化和反序列化二叉树https://blog.csdn.net/sniperken/article/details/53893338
两个链表第一个公共节点https://www.cnblogs.com/lishanlei/p/10707681.html
二叉树的下一个节点https://www.cnblogs.com/lishanlei/p/10707649.html
一个链表怎么判断是不是环https://blog.csdn.net/u010983881/article/details/78896293
洗牌算法https://www.cnblogs.com/millionsmultiplication/p/9570258.html
二叉搜索树与双向链表(注意head和pre就行)https://cyc2018.github.io/CS-Notes/#/notes/36.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E4%B8%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8
在一个字符串中找到重复次数最多的子串，这个子串长度大于2
两个排序数组找中位数
计算一个根号3 如果不用现成的方法自己算
最长重复子序列
二叉树的先序遍历非递归
矩阵之字形遍历https://www.lintcode.com/problem/matrix-zigzag-traversal/description
剪绳子https://www.jianshu.com/p/63b780a3157a https://blog.csdn.net/qq_36162275/article/details/87688232
最长回文串https://www.lintcode.com/problem/longest-palindrome/description
最长回文子串（dp，注意有等号！！）https://www.jianshu.com/p/138ff21d9ede（此处的k指的是长度）
最长回文子序列（dp）https://blog.csdn.net/Ming991301630/article/details/83587429 https://leetcode-cn.com/problems/longest-palindromic-subsequence/submissions/
网易https://snailclimb.gitee.io/javaguide/#/docs/dataStructures-algorithms/%E5%85%AC%E5%8F%B8%E7%9C%9F%E9%A2%98
树的子结构
对称二叉树https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
顺时针打印数组https://cyc2018.github.io/CS-Notes/#/notes/29.%20%E9%A1%BA%E6%97%B6%E9%92%88%E6%89%93%E5%8D%B0%E7%9F%A9%E9%98%B5
二叉搜索树的后序遍历https://cyc2018.github.io/CS-Notes/#/notes/33.%20%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91%E7%9A%84%E5%90%8E%E5%BA%8F%E9%81%8D%E5%8E%86%E5%BA%8F%E5%88%97?id=_33-%e4%ba%8c%e5%8f%89%e6%90%9c%e7%b4%a2%e6%a0%91%e7%9a%84%e5%90%8e%e5%ba%8f%e9%81%8d%e5%8e%86%e5%ba%8f%e5%88%97
复制复杂链表https://cyc2018.github.io/CS-Notes/#/notes/35.%20%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6
根据先序遍历构建二叉树，根据层次遍历构建二叉树
堆排序
最小第k个数
最大连续子数组https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
1到n有多少个1https://www.cnblogs.com/aimi-cn/p/11510770.html
数字翻译成字符串（有点像青蛙跳台阶）https://cyc2018.github.io/CS-Notes/#/notes/46.%20%E6%8A%8A%E6%95%B0%E5%AD%97%E7%BF%BB%E8%AF%91%E6%88%90%E5%AD%97%E7%AC%A6%E4%B8%B2
礼物最大价值（动态规划）https://cyc2018.github.io/CS-Notes/#/notes/47.%20%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC
判断顺子https://cyc2018.github.io/CS-Notes/#/notes/61.%20%E6%89%91%E5%85%8B%E7%89%8C%E9%A1%BA%E5%AD%90
约瑟夫环（注意f(n,m)为一个n个数的圈最后剩下的下标） https://cyc2018.github.io/CS-Notes/#/notes/62.%20%E5%9C%86%E5%9C%88%E4%B8%AD%E6%9C%80%E5%90%8E%E5%89%A9%E4%B8%8B%E7%9A%84%E6%95%B0
约瑟夫环每次打印出的下标https://blog.csdn.net/byn12345/article/details/79487253
二叉搜索树最低公共祖先节点https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof/submissions/
二叉树最低公共祖先节点https://leetcode-cn.com/problems/er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof/
搭积木https://www.nowcoder.com/practice/55371b74b2f243e3820e57ee4c7b5504?tpId=98&tqId=32841&rp=1&ru=%2Fta%2F2019test&qru=%2Fta%2F2019test%2Fquestion-ranking&tPage=1
数组的m个子段最大和(动态规划)https://blog.csdn.net/winter2121/article/details/72848482
游戏海报https://www.nowcoder.com/practice/6a6a0e4d6dfa4d89acd73bdfec79cf28?tpId=98&tqId=32848&rp=1&ru=%2Fta%2F2019test&qru=%2Fta%2F2019test%2Fquestion-ranking&tPage=2
m个框放n个苹果https://blog.csdn.net/u013074465/article/details/45505279
最少数量货物https://blog.csdn.net/qq_41022094/article/details/98124849
判断矩阵有无重合https://www.lintcode.com/problem/rectangle-overlap/description
对于Stringbuilder的运用https://www.nowcoder.com/test/question/42852fd7045c442192fa89404ab42e92?pid=16516564&tid=30983949
对HashMap的应用https://www.nowcoder.com/question/next?pid=16516564&qid=362290&tid=30985355
经典找零问题https://www.nowcoder.com/questionTerminal/944e5ca0ea88471fbfa73061ebe95728
对于LinkedHahsmap，substring（）的运用https://www.nowcoder.com/practice/2baa6aba39214d6ea91a2e03dff3fbeb?tpId=37&tqId=21242&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
密码检验https://www.nowcoder.com/practice/184edec193864f0985ad2684fbc86841?tpId=37&tqId=21243&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
最长非降子序列（易错，注意一定要将dp[i]设为1，如果不是这样的话，那么像521321423的1对应的dp[2]就是零，那么到2（即第5个）的时候，对应dp[4]=dp[2]+1=1就不正确了）https://blog.csdn.net/hustqter/article/details/51200018
合唱队（对最长非降子序列的运用）https://www.nowcoder.com/practice/6d9d69e3898f45169a441632b325c7b4?tpId=37&tqId=21247&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
注意s="020",Integer.valueof(s)=20
注意此题赖皮解法https://www.nowcoder.com/practice/d3d8e23870584782b3dd48f26cb39c8f?tpId=37&tqId=21253&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
兔子（动态规划）https://www.nowcoder.com/practice/1221ec77125d4370833fd3ad5ba72395?tpId=37&tqId=21260&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
求小球落地5次后所经历的路程和第5次反弹的高度https://www.nowcoder.com/practice/2f6f9339d151410583459847ecc98446?tpId=37&tqId=21261&rp=0&ru=%2Fta%2Fhuawei&qru=%2Fta%2Fhuawei%2Fquestion-ranking&tPage=2
递归的使用https://www.nowcoder.com/practice/1364723563ab43c99f3d38b5abef83bc?tpId=37&tqId=21265&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
bigInteger的运用https://www.nowcoder.com/practice/49e772ab08994a96980f9618892e55b6?tpId=37&tqId=21280&tPage=3&rp=&ru=/ta/huawei&qru=/ta/huawei/question-ranking
矩阵相乘https://www.nowcoder.com/practice/ebe941260f8c4210aa8c17e99cbc663b?tpId=37&tqId=21292&tPage=4&rp=&ru=/ta/huawei&qru=/ta/huawei/question-ranking
百钱买百鸡https://www.nowcoder.com/practice/74c493f094304ea2bda37d0dc40dc85b?tpId=37&tqId=21295&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
括号生成，分礼物https://leetcode-cn.com/problems/generate-parentheses/
正方形矩阵的多次90度旋转https://editor.csdn.net/md?articleId=104753532
诶及分数https://my.oschina.net/u/2822116/blog/828263
不区分大小写给字符排序(stringbuilder的insert使用)https://www.nowcoder.com/practice/5190a1db6f4f4ddb92fd9c365c944584?tpId=37&tqId=21249&rp=0&ru=/ta/huawei&qru=/ta/huawei/question-ranking
二进制转化为十进制 Integer.parseInt("二进制字符串"，2)其他进制转化为十进制同理
三角形https://blog.csdn.net/weixin_38478542/article/details/100139641?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522158391279819724848323085%2522%252C%2522scm%2522%253A%252220140713.130056874..%2522%257D&request_id=158391279819724848323085&biz_id=0&utm_source=distribute.pc_search_result.none-task
平面坐标上遍历给出的点https://editor.csdn.net/md?articleId=104816116
旅行商问题（直接全排列将所有可能都列出来比较即可）
字符串问题（注意思路）https://www.nowcoder.com/question/next?pid=16516564&qid=362294&tid=31372032zi
字符串转大数，字符串与“”的拼接https://www.nowcoder.com/test/question/done?tid=31374201&qid=894531#summary
可并列排名问题（n个人多少种排法）https://blog.csdn.net/zyzmzm_/article/details/96579312
经典滑动窗口https://www.nowcoder.com/test/question/done?tid=31395135&qid=894514#summary
字符串距离https://www.nowcoder.com/practice/82bd533cd9c34df29ba15bbf1591bedf?tpId=110&tqId=33429&tPage=1&rp=1&ru=/ta/job-code&qru=/ta/job-code/question-ranking
数组分成两份使其差最小https://blog.csdn.net/shanshanhi/article/details/67639562
从左和从右分别求出最大递增子序列重合的点即为所求https://www.nowcoder.com/practice/2818df3e10c44f859e49048875a71d34?tpId=110&tqId=33432&tPage=1&rp=1&ru=/ta/job-code&qru=/ta/job-code/question-ranking
数位dp 牛牛恨66
递增数组https://www.nowcoder.com/practice/d0907f3982874b489edde5071c96754a?tpId=110&tqId=33452&tPage=2&rp=2&ru=/ta/job-code&qru=/ta/job-code/question-ranking
https://www.nowcoder.com/practice/efc16ce46397436a8d1a0008c52093c1?tpId=110&tqId=33423&tPage=1&rp=1&ru=/ta/job-code&qru=/ta/job-code/question-ranking
田忌赛马（四个指针，田忌min，max和大王min，max）
点与点间最短距离（区分毕业旅行问题：不是某点到某点，而是覆盖全部点）（floyd算法）https://blog.csdn.net/qq_34842671/article/details/90637502 https://www.cnblogs.com/yeqluofwupheng/p/6661400.html（看题目描述）
字符串的划分https://www.nowcoder.com/question/next?pid=21910764&qid=894513&tid=31591951
火星文字典（拓扑排序）https://editor.csdn.net/md?articleId=104926543
字符串正则匹配（注意*的三种情况即可：1.匹配0个2.匹配1个---》加模式串和母串的下标3.暂时匹配1个--》只是母串下标加）https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
按字典序排https://www.nowcoder.com/question/next?pid=21910835&qid=894530&tid=31653139
图的遍历（求出图最长路径后，其他的边乘以二即为答案）https://www.nowcoder.com/question/next?pid=16516326&qid=362170&tid=31674185