2020年2月6日
63. Unique Paths II
摘要： Problem : 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 righ 阅读全文
posted @ 2020-02-06 18:12 littledy 阅读(98) 评论(0) 推荐(0)
动态规划
摘要： 动态规划具备以下三个特点： 1.把原来的问题分解成几个 相似的子问题 ； 2.所有的子问题 只需要解决一次 ； 3. 储存 子问题的解。 LeetCode DP算法分类题目链接： 动态规划的问题有很多种，只能通过多刷才能知道对哪一类的问题应用DP算法求解方便。 阅读全文
posted @ 2020-02-06 16:15 littledy 阅读(116) 评论(0) 推荐(0)
62. Unique Paths
摘要： Problem : 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 righ 阅读全文
posted @ 2020-02-06 12:05 littledy 阅读(93) 评论(0) 推荐(0)
141. Linked List Cycle
摘要： Problem : Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked list, we use an integer pos which represent 阅读全文
posted @ 2020-02-06 09:39 littledy 阅读(154) 评论(0) 推荐(0)
2020年2月5日
136. Single Number
摘要： Problem : Given a non empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a li 阅读全文
posted @ 2020-02-05 22:58 littledy 阅读(96) 评论(0) 推荐(0)
125. Valid Palindrome
摘要： Problem : Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Note: For the purpose of this 阅读全文
posted @ 2020-02-05 22:27 littledy 阅读(71) 评论(0) 推荐(0)
122. Best Time to Buy and Sell Stock II
摘要： Problem : Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You 阅读全文
posted @ 2020-02-05 11:05 littledy 阅读(85) 评论(0) 推荐(0)
2020年2月4日
121. Best Time to Buy and Sell Stock
摘要： Problem : Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one t 阅读全文
posted @ 2020-02-04 20:47 littledy 阅读(95) 评论(0) 推荐(0)
119. Pascal's Triangle II
摘要： Problem : Given a non negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. In Pasc 阅读全文
posted @ 2020-02-04 20:05 littledy 阅读(82) 评论(0) 推荐(0)
118. Pascal's Triangle
摘要： Problem : Given a non negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the t 阅读全文
posted @ 2020-02-04 11:22 littledy 阅读(94) 评论(0) 推荐(0)