- 博客(9)
- 收藏
- 关注
原创 【LeetCode】TwoSum
题目: 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 us
2017-09-13 10:48:46 151
原创 【LeetCode】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
2017-09-13 10:41:13 164
原创 【LeetCode】Add Binary
题目: Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". 思路:1. 首先我们要理解 二进制是什么意思,网上有很多文章对此进行讲解,这里不再加以详细说明。 2. 我们要想清楚的是, 无论
2017-08-04 23:33:02 181
原创 【LeetCode】Expression Add Operators
题目: Given a string that contains only digits 0-9 and a target value, return all possibilities to add binary operators (not unary) +, -, or * between the digits so they evaluate to the target
2017-07-03 13:18:46 169
原创 【LeetCode】Integer to English Words
题目: Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231- 1. For example, 123 -> "One Hundred Twenty Three" 12345 -> "Twelve Thou
2017-07-02 11:19:33 136
原创 【LeetCode】Longest Consecutive Sequence
题目: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4, 200, 1, 3, 2], The longest consecutive elements sequence is
2017-06-29 14:33:25 173
原创 【LeetCode】 Minimum Window Substring
题目: Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T = "ABC" Minimum window
2017-06-28 12:16:20 185
原创 【LeetCode】InsertInterval
题目: Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start tim
2017-06-27 11:34:02 178
原创 【LeetCode】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]. 个人解析与理解:1.给定的collection 没有说明有序,所以要对它先进性排序
2017-06-26 11:16:12 184
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人