摘要：
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文
阅读排行榜
[LeetCode] 559. Maximum Depth of N-ary Tree_Easy tag: DFS
2018-08-09 09:00 by Johnson_强生仔仔, 278 阅读, 收藏,
摘要：
Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest le 阅读全文
[LeetCode] 64. Minimum Path Sum_Medium tag: Dynamic Programming
2018-07-19 06:52 by Johnson_强生仔仔, 278 阅读, 收藏,
摘要：
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 its path. 阅读全文
[LeetCode] 109. Convert Sorted List to Binary Search Tree_Medium tag: Linked List
2019-05-06 05:00 by Johnson_强生仔仔, 277 阅读, 收藏,
摘要：
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bina 阅读全文
[LeetCode] 34. Find First and Last Position of Element in Sorted Array == [LintCode] 61. Search for a Range_Easy tag: Binary Search
2018-08-29 10:06 by Johnson_强生仔仔, 277 阅读, 收藏,
摘要：
Description Given a sorted array of n integers, find the starting and ending position of a given target value. If the target is not found in the array 阅读全文
浙公网安备 33010602011771号