摘要：
Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Note: There may be more than one LIS combination, it 阅读全文
posted @ 2019-08-30 23:32
琴影
阅读(804)
评论(0)
推荐(0)
摘要：
Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: 思路：回溯（dfs） 阅读全文
posted @ 2019-08-30 09:47
琴影
阅读(226)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. Note: A leaf is a node with no children. Exampl 阅读全文
posted @ 2019-08-30 09:28
琴影
阅读(179)
评论(0)
推荐(0)
摘要：
Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文
posted @ 2019-08-30 00:17
琴影
阅读(182)
评论(0)
推荐(0)
浙公网安备 33010602011771号