路线
文章平均质量分 71
jmspan
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
LeetCode 174. Dungeon Game(游戏)
原题网址:https://leetcode.com/problems/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 ou原创 2016-05-25 01:35:03 · 596 阅读 · 0 评论 -
LeetCode 6. ZigZag Conversion(之字形)
原题网址:https://leetcode.com/problems/zigzag-conversion/ The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a原创 2016-05-19 03:47:47 · 505 阅读 · 0 评论 -
LeetCode 54. Spiral Matrix(螺旋矩阵)
原题网址:https://leetcode.com/problems/spiral-matrix/ Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following mat原创 2016-05-21 06:56:42 · 761 阅读 · 0 评论 -
LeetCode 59. Spiral Matrix II(螺旋矩阵)
原题网址:https://leetcode.com/problems/spiral-matrix-ii/ Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. For example, Given n = 3, You should retu原创 2016-05-21 07:50:26 · 449 阅读 · 0 评论 -
LeetCode 62. Unique Paths(唯一路线)
原题网址:https://leetcode.com/problems/unique-paths/ A 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 a原创 2016-05-21 09:29:27 · 409 阅读 · 0 评论 -
LeetCode 64. Minimum Path Sum(最小路径和)
原题网址:https://leetcode.com/problems/minimum-path-sum/ Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along it原创 2016-05-21 11:59:41 · 1318 阅读 · 0 评论 -
LeetCode 63. Unique Paths II(唯一路径)
原题网址:https://leetcode.com/problems/unique-paths-ii/ Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle an原创 2016-05-22 00:04:41 · 378 阅读 · 0 评论 -
LeetCode 103. Binary Tree Zigzag Level Order Traversal(二叉树之字形遍历)
原题网址:https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right原创 2016-05-23 03:58:09 · 1435 阅读 · 0 评论
分享