soulmachine / algorithm-essentials Goto Github PK
View Code? Open in Web Editor NEW算法精粹--举一反三，抛弃题海战术
License: GNU General Public License v3.0
algorithm-essentials's People
Contributors
Stargazers
Watchers
Forkers
serpheroth jeffzhengye sanwan younging shijiema benjaminujun dutao-88 zhi-ge yidachen jianminchen sandezi1992 hehedalalal hb44 rishards zhizunbao84 fenildf elsevierofchina bill1316 joejiafeng starrynsky zzzhy muxi166 luoolu hbcbh1999 sunchenglong semicoyoung wey068 rockyfun tw-qt viphuangwei wulikk lol666666 liutianze oldcwj zhuohuwu0603 april53 yuan39 majia1949 yankaics lpj0017 chaitanyaphalak lisajing xinpengliu sky-co lzufalcon saadmahboob xudongzhang iamthewind yanliangwang mjlong iwifigame jiangpingplus lantianhe chengguobiao metesa dodoyuan galaxy0101 lixueyi83 hellozepp wxj1993 asjqmasjqm ethan0721 rapsoulhaonan ngts-aus cynthia0911 haiwei-li csxwin skywater zcx185973968 hsissnn tpehacker michaelzxh mrfiona naqushab yutian-tianpl coding4real last1949 pengkuang 343829084 fangj99 williamarthur nevertopsecret aawwuu algodock zhaohuiqiang weijie1994 fanyun-01 sjl421 nicholasxt cstobe xiangruipuzhao ewenwan zhengliansheng lwxk tangjiqunliu mountain-rock ailyanlu1 cquliaoli pathjh fengzhi19940518algorithm-essentials's Issues
English version of the book
算法精粹 - Remove Duplicates from Sorted Array II 示例代码似乎有误
首先，谢谢提供如此好的一个教程帮助初学者或像我这种忘记的差不多的人重新学习。
示例代码似乎有误，我在leecode中尝试了，不能通过，因为nums中的元素被替换，所以好比[1,1,1,2,2,3]这样的list会出错。
我找到一个稍微简单的办法处理这种问题，直接删除list中重复的元素，示例代码如下（n=2,使用其他n>2的情况):
class Solution(object):
def removeDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums) <= 2:
return len(nums)
idx = 2
while idx < len(nums):
if nums[idx-2]== nums[idx]:
del nums[idx]
else:
idx+=1
return len(nums)
DP-Longest Increasing Subsequence解析中有个小错误
解法１的状态转移方程应该是：
f[j] = max{f[i], 0 <= i < j && nums[i] < nums[j]} + 1
原来的写成了：
f[j] = max{f[i], 0 <= i < j && f[i] < f[j]} + 1
Remove Duplicates from Sorted Array II 注解未更新
Remove Duplicates from Sorted Array II 代码 2 注解：
下面是一个更简洁的版本。上面的代码略长，不过扩展性好一些，例如将
occur < 2改为occur < 3，就变成了允许重复最多 3 次。
代码 1 所用变量名为N = 2，而非occur < 2
两个求和的问题
他的原理是什么，有没有好心人讲解一下
Remove Duplicates from Sorted Array II 注解未更新
Remove Duplicates from Sorted Array II 代码 2 注解：
下面是一个更简洁的版本。上面的代码略长，不过扩展性好一些，例如将
occur < 2改为occur < 3，就变成了允许重复最多 3 次。
代码 1 所用变量名为N = 2，而非occur < 2
Symmetric Tree的描述和sametree一样
如题
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.