摘要：
Given two words word1 and word2, find the minimum number of operations required to convert word1to word2. You have the following 3 operations permitte 阅读全文
阅读排行榜
[LeetCode] 63. Unique Paths II_ Medium tag: Dynamic Programming
2019-04-23 09:36 by Johnson_强生仔仔, 268 阅读, 收藏,
摘要：
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 p 阅读全文
[LeetCode] 844. Backspace String Compare_Easy tag: Stack, Two pointers
2018-08-18 10:52 by Johnson_强生仔仔, 268 阅读, 收藏,
摘要：
Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character. Example 1: Input: S = 阅读全文
[LeetCode] 1. Two Sum_Easy tag: Hash Table
2018-08-10 12:16 by Johnson_强生仔仔, 268 阅读, 收藏,
摘要：
Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex 阅读全文
[LeetCode] 124. Binary Tree Maximum Path Sum_ Hard tag: DFS recursive, Divide and conquer
2018-07-18 05:47 by Johnson_强生仔仔, 268 阅读, 收藏,
摘要：
Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any 阅读全文
浙公网安备 33010602011771号