mincostClimbingStairs and majorityElement#652
Merged
GeekUniversity merged 1 commit intoalgorithm001:masterfrom May 13, 2019
Merged
mincostClimbingStairs and majorityElement#652GeekUniversity merged 1 commit intoalgorithm001:masterfrom
GeekUniversity merged 1 commit intoalgorithm001:masterfrom
Conversation
tidelgl
reviewed
May 11, 2019
| @@ -0,0 +1,7 @@ | |||
| class Solution: | |||
| def minCostClimbingStairs(self, cost: List[int]) -> int: | |||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
还是选着两个比较简单的算法题做了，其他难度高的感觉有些难啃，要花一些事情去想。找众数这个题用到一个哈希表记录数字出现的次数。遍历整个列表一次记录次数，再遍历哈希表找出众数。求爬楼梯花费最小的这个题目使用到动态规划的知识。