leetcode
YorkChu
carpe diem
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
[LeetCode日记指南] 17. Letter Combinations of a Phone Number(回溯法)
题目描述 Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) i...原创 2019-04-04 23:07:56 · 239 阅读 · 0 评论 -
[LeetCode日记指南] 215. Kth Largest Element in an Array(多种方法)
题目描述 Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) i...翻译 2019-04-05 00:12:32 · 200 阅读 · 0 评论 -
[LeetCode日记指南] 617. Merge Two Binary Trees(递归法)
题目描述 Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. You need to merge them into a new binary...原创 2019-03-31 21:06:03 · 224 阅读 · 0 评论 -
[LeetCode日记指南] 3. Longest Substring Without Repeating Characters(HashMap)
题目描述 Given a string, find the length of the longest substring without repeating characters. Example 1: Input: “abcabcbb” Output: 3 Explanation: The answer is “abc”, with the length of 3. 思路 维护一个字典保存...原创 2019-04-05 22:33:56 · 186 阅读 · 0 评论 -
[LeetCode日记指南] 56.Merge Intervals(排序法)
题目描述 Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. 思路 这题没有明确了输入区间集是有序的,所以首先要做的就是给区间集排序,我们以start的值从小到大来...原创 2019-04-02 10:50:58 · 191 阅读 · 0 评论 -
[LeetCode日记指南] 2. Add Two Numbers(遍历)
题目描述 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and re...原创 2019-04-02 22:27:26 · 193 阅读 · 0 评论
分享