LeetCode
文章平均质量分 64
_tianyuxue
这个作者很懒,什么都没留下…
展开
-
[LeetCode - 桶排序] 41. First Missing Positive
1 问题 Given an unsorted integer array, find the first missing positive integer. For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2. Your algorithm should run in O(n) time and us原创 2017-05-24 18:50:08 · 390 阅读 · 0 评论 -
[LeetCode - 日志系统设计] 635. Design Log Storage
1 题目 You are given several logs that each log contains a unique id and timestamp. Timestamp is a string that has the following format: Year:Month:Day:Hour:Minute:Second, for example, 2017:01:01:23:59原创 2017-07-10 15:59:51 · 7875 阅读 · 0 评论 -
[LeetCode - 贪心算法]630. Course Schedule III
1 题目 There are n different online courses numbered from 1 to n. Each course has some duration(course length) t and closed on dth day. A course should be taken continuously for t days and must be fini原创 2017-07-06 20:42:22 · 1723 阅读 · 0 评论 -
[LeetCode - BFS & Stack] 103. Binary Tree Zigzag Level Order Traversal
1 题目 Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between). For example: Given原创 2017-06-06 20:42:13 · 350 阅读 · 0 评论 -
[LeetCode - 回溯] 22. Generate Parentheses
1 题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "(原创 2017-06-05 21:14:58 · 333 阅读 · 0 评论 -
[LeetCode - 双指针] 19. Remove Nth Node From End of List
1 问题 Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from th原创 2017-05-30 20:18:44 · 229 阅读 · 0 评论 -
[LeetCode - 排序] 56. Merge Intervals
1 问题 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]. 2 分析题目要合并重叠的区间,直觉上需要将区间排序。排序的方法是: 先按照区间左端点排原创 2017-05-27 21:58:06 · 326 阅读 · 0 评论 -
[LeetCode - 滑动窗口] 3. Longest Substring Without Repeating Characters
1 问题 Given a string, find the length of the longest substring without repeating characters. Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the answer原创 2017-05-02 18:55:41 · 565 阅读 · 0 评论 -
[LeetCode - 模拟加法] 2. Add Two Numbers
1 问题 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原创 2017-05-02 10:47:19 · 278 阅读 · 0 评论 -
[LeetCode - 哈希表] 1. Two Sum
1 问题 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 exactly one solution, and you may not use t原创 2017-04-29 22:13:41 · 431 阅读 · 0 评论 -
[LeetCode - 字符串] 6. ZigZag Conversion
1 问题 The string “PAYPALISHIRING” is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S原创 2017-05-03 10:43:36 · 321 阅读 · 0 评论 -
[LeetCode - 数学] 7. Reverse Integer
1 题目 Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 2 分析本题的解决主要依靠存在的数学关系:令 numnum 表示任意数字,那么 num % 10 表示 numnum 的最后一位数字 num / 10 表示 numnum 去掉最后一位数字的值原创 2017-05-04 09:36:09 · 223 阅读 · 0 评论 -
[LeetCode - 动态规划] 10. Regular Expression Matching
1 问题 Implement regular expression matching with support for ‘.’ and ‘*’. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire inpu原创 2017-05-09 21:51:02 · 938 阅读 · 0 评论 -
[LeetCode - 双指针] 11. Container With Most Water
1 问题 Given n non-negative integers a1,a2,...,an,a_1, a_2, ..., a_n, where each represents a point at coordinate (i,ai)(i, a_i). n vertical lines are drawn such that the two endpoints of line i is at原创 2017-05-10 22:16:43 · 269 阅读 · 0 评论 -
[LeetCode - 回溯] 39. Combination Sum
1 问题 Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be cho原创 2017-05-21 22:00:25 · 303 阅读 · 0 评论 -
[LeetCode - 动态规划] 120. Triangle
1 题目Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5,7原创 2017-11-01 10:30:34 · 422 阅读 · 0 评论