-
Notifications
You must be signed in to change notification settings - Fork 152
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
算法训练营第四周作业 #509
Comments
学号:121 Username:lovingcodesk |
学号:095 Username:AndroidQin |
作业提交积极,赞。代码清晰易读 |
学号:064 Username:李路 |
学号:027 Username:zjg23 |
学号:126 Username:suncen0505 |
我也是做了两道简单的题,还是依据老师的套路,用了笨法,再去化简的,感觉老师的套路泰通用了 |
你做了好多题呀,我也喜欢在本上记笔记,不过最近发现本上记录好像找一个知识点有点费劲,哈哈 ,最近在考虑用在线笔记做记录呢 |
一起加油吧,我这得抓紧跟啊 |
我好像还没用过前序遍历、中序遍历和后序遍历,一直在用同一种递归,有时间去优化下代码 |
学号:086 Username: SherryShi0108 |
活动结束,但是咱们的学习没有结束,以后学完咱们好好交流 |
我也得再重新看一遍,到时候学完咱们再总结,一起交流 |
学号:023 Username: ericyang89 |
学号:131 Username: HongChao6 |
以后咱们就在这个github上建分支呗,然后有问题在 issue 上提交,每次的leetcode题也可提交 |
嗯,一起努力吧 |
我跟你实现的方法一样,不过我是用C++,看你 JAVA 代码正好熟悉一下不同语言 |
感觉784可以 先将字母处理成数字,然后用 hash 实现 |
动态规划一般可以用填表来实现,还是做题少,不大熟练 |
|
嗯,记在在线笔记上能够笔记好的查阅以前的记录! |
学号:040 Username: salanhess |
学号:061 Username:[email protected](贾凯超) |
学号:014 Username:aiter |
764 写得真好,这题我花了不少时间 |
学号:009 用户名:AHaoPang |
学号:044 Username: yxs354 |
学号:065 Username: shironghui0593 |
学号: 063 (9组) |
学号:100 Username:bin_albin |
做题心得很是认同 |
学号:71 Username:hfcc8685 |
学习了 |
学号:119 Username:kk5171 |
学号:002 Username:cwbcheng |
学号:058 Username:maguangjun(马光君) |
学号:054 Username:taolei0108 |
学号:041 username:mikejacken |
学号:075 Username:tommy1989 |
学号:067 Username:yulongz |
学号:139 Username:dreakzss |
学号:115 Username:1005419213zxf |
学号:086 Username: SherryShi0108 |
学号:132 Username: wwb4694376 |
学号:082 Username: IMC666 |
学号:134 Username:wxisme |
学号057 |
学号:028 Username:myrichhub |
学号:081 Username:abinbao |
学号:137 Username:songsmith |
学号:104 username:flowbwyind |
学号: 047 username: wcvolcano |
学号: 135 username:oxcz |
学号: 144 username:liutong_cnu |
学号: 124 username:luckypeak |
学号:024 username:lglove(李戈) |
本周重点学习知识点
Trie树、AC自动机、贪心算法、分治算法、回溯算法、动态规划
要求
注意事项
第四周题目
Trie树
简单:https://leetcode-cn.com/problems/longest-word-in-dictionary/
中等:https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/
困难:https://leetcode-cn.com/problems/word-search-ii/
分治算法
简单:https://leetcode-cn.com/problems/majority-element/
中等:https://leetcode-cn.com/problems/different-ways-to-add-parentheses/
困难:https://leetcode-cn.com/problems/burst-balloons/
贪心算法
简单:https://leetcode-cn.com/problems/assign-cookies/
中等:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
困难:https://leetcode-cn.com/problems/ipo/
回溯算法
简单:https://leetcode-cn.com/problems/letter-case-permutation/
中等:https://leetcode-cn.com/problems/add-and-search-word-data-structure-design/
困难:https://leetcode-cn.com/problems/n-queens/
动态规划
简单:https://leetcode-cn.com/problems/min-cost-climbing-stairs/
中等:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
困难:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/
困难:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/
困难:https://leetcode-cn.com/problems/edit-distance/
作业提交规则
The text was updated successfully, but these errors were encountered: