202003-05 [LeetCode每日一题]64. 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.... Read More >
202003-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 >
202003-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 >
202003-02 [LeetCode每日一题]10. Regular Expression Matching 题目如下: Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'. '.' Matches any single charac.... Read More >
202002-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 >
202002-27 [LeetCode每日一题]5. Longest Palindromic Substring 题目如下: 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 >
202002-26 [LeetCode每日一题]116. Populating Next Right Pointers in Each Node 题目如下: 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 >
202002-25 [LeetCode每日一题]114. Flatten Binary Tree to Linked List 题目如下: Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 .... Read More >
202002-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 >
202002-23 [LeetCode每日一题]108. Convert Sorted Array to Binary Search Tree 题目如下: 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 >