
leetcode算法学习
文章平均质量分 60
解明月
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
算法学习之动态规划(leetcode 91 Decode Ways)
leetcode 91. Decode Ways A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determ原创 2016-10-28 23:59:07 · 474 阅读 · 0 评论 -
算法学习之动态规划(leetcode 44 Wildcard Matching)
Wildcard Matching原创 2016-10-29 16:14:04 · 923 阅读 · 0 评论 -
算法学习之回溯法(leetcode 140. Word Break II)
leetcode 140. Word Break II Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For e原创 2016-10-29 17:36:29 · 607 阅读 · 0 评论 -
算法学习之动态规划(leetcode 174. Dungeon Game)
leetcode 174. Dungeon Game The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant k原创 2016-10-31 23:59:40 · 688 阅读 · 0 评论 -
算法学习之动态规划(leetcode 304. Range Sum Query 2D - Immutable)
leetcode 304. Range Sum Query 2D - ImmutableGiven a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2)原创 2016-11-02 20:22:23 · 510 阅读 · 0 评论 -
算法学习之动态规划(leetcode 62. Unique Paths)
0x01题目62. Unique PathsA robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is tr原创 2017-03-17 15:11:00 · 473 阅读 · 0 评论 -
算法学习之动态规划(leetcode 87. Scramble String)
0x01题目Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great":To scramble the string, we原创 2017-04-08 15:48:22 · 898 阅读 · 0 评论 -
算法学习之动态规划(leetcode 72. Edit Distance)
0x01题目72. Edit DistanceGiven two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations p原创 2016-11-30 22:18:44 · 411 阅读 · 0 评论 -
算法学习之动态规划(leetcode 85. Maximal Rectangle)
85. Maximal Rectangle原创 2017-03-15 16:59:00 · 8647 阅读 · 1 评论