1. 原题链接 https://leetcode.com/problems/unique-paths/description/ 2. 题目要求 给定一个m*n的棋盘,从左上角的格子开始移动,每次只能向右或向下移动一格,直至右下角的格子.返回所有不同路径的总数. 注意:m和n都不超过100 3. 解题思路…

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 at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in t…

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 at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in t…

62. Unique Paths class Solution { public: int uniquePaths(int m, int n) { || n <= ) ; vector<vector<int> > dp(m,vector<int>(n)); dp[][] = ; ;i < m;i++) dp[i][] = ; ;i < n;i++) dp[][i] = ; ;i < m;i++){ ;j < n;j++){ dp[i][j]…

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 at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in t…

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 at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in t…

原题链接 字母题 : unique paths Ⅱ 思路: dp[i][j]保存走到第i,j格共有几种走法. 因为只能走→或者↓,所以边界条件dp[0][j]+=dp[0][j-1] 同时容易得出递推 dp[i][j]+=dp[i-1][j]+dp[i][j-1] class Solution { public: int uniquePaths(int m, int n) { if (m == 0 || n == 0) { return 0; } vector<vector<int>&g…

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 at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in t…

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 at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in t…

1. 原题链接 https://leetcode.com/problems/rotate-list/description/ 2. 题目要求 给出一个链表的第一个结点head和正整数k,然后将从右侧开始数第k个结点之后的链表与之前的链表交换位置,例如 3. 解题思路 (1)首先要注意head结点不是指头结点,而是指第一个结点: (2)当head为null或者链表中只有一个结点时,返回head: (3)个人觉得题目出的很不友好,当k=链表的长度时,返回的时原链表:当k大于链表的长度时,则不是...…