2020
03-05
03-05
[LeetCode每日一题]64. Minimum Path Sum
![[LeetCode每日一题]64. Minimum Path Sum](https://weiguangli.com/wp-content/themes/frontopen2_v1.5.04.15/timthumb.php?src=https://weiguangli.com/wp-content/uploads/2020/02/LeetCode_Sharing.png&h=140&w=205&zc=1)
题目如下：
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.... Read More >
标签归档：LeetCode
题目如下：
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.... Read More >
2020
03-04
03-04
[LeetCode每日一题]63. Unique Paths II
题目如下：
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 .... Read More >
2020
03-03
03-03
[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' -> 26
Given a non-emp.... Read More >
题目如下：
Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.
'.' Matches any single charac.... Read More >
2020
02-29
02-29
[LeetCode每日一题]62. 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 .... Read More >
题目如下：
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
5. Longest Palindromic S.... Read More >
题目如下：
You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the followi.... Read More >
题目如下：
Given a binary tree, flatten it to a linked list in-place.
For example, given the following tree:
1
/ \
2 5
/ \ \
3 .... Read More >
2020
02-24
02-24
[LeetCode每日一题]113. Path Sum II
题目如下：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
给定一棵二叉树和一个整数sum，让我们找出所有从根节点到叶子节点权值之和为.... Read More >
题目如下：
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
For this problem, a height-balanced binary t.... Read More >