![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
占位
LUCASYAN个
这个作者很懒,什么都没留下…
展开
-
636. Exclusive Time of Functions
Given the running logs of n functions that are executed in a nonpreemptive single threaded CPU, find the exclusive time of these functions.Each function has a unique id, start from 0 to n-1. A fun原创 2017-09-16 09:02:56 · 307 阅读 · 0 评论 -
80. Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first fi原创 2017-09-16 09:02:04 · 220 阅读 · 0 评论 -
567. Permutation in String
Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string's permutations is the substring of the second string.Ex原创 2017-09-16 09:01:38 · 297 阅读 · 0 评论 -
75. Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers原创 2017-09-16 09:01:10 · 224 阅读 · 0 评论 -
312 Burst Balloons
Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get num原创 2017-09-16 08:58:35 · 160 阅读 · 0 评论 -
210. Course Schedule II
There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordin原创 2017-09-05 00:06:08 · 152 阅读 · 0 评论 -
310. Minimum Height Trees
Given a string s and a string t, check if s is subsequence of t.You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) strin原创 2017-09-05 00:06:28 · 166 阅读 · 0 评论 -
207. Course Schedule
3原创 2017-09-06 14:22:59 · 137 阅读 · 0 评论 -
417. Pacific Atlantic Water Flow
4原创 2017-09-06 14:23:10 · 137 阅读 · 0 评论 -
200. Number of Islands
5原创 2017-09-06 14:23:22 · 146 阅读 · 0 评论 -
621. Task Scheduler
第一道题站位原创 2017-09-06 14:22:27 · 241 阅读 · 0 评论 -
466. Count The Repetitions
Define S = [s,n] as the string S which consists of n connected strings s. For example, ["abc", 3] ="abcabcabc".On the other hand, we define that string s1 can be obtained from string s2 if we ca原创 2017-09-07 23:00:05 · 900 阅读 · 0 评论 -
600. Non-negative Integers without Consecutive Ones
Given a positive integer n, find the number of non-negative integers less than or equal to n, whose binary representations do NOT contain consecutive ones.Example 1:Input: 5Output: 5Explanat原创 2017-09-07 23:02:03 · 171 阅读 · 0 评论 -
629. K Inverse Pairs Array
Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs.We define an inverse pair as following: For ith and jth el原创 2017-09-07 23:02:29 · 160 阅读 · 0 评论 -
282. 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 value.原创 2017-09-12 23:37:21 · 190 阅读 · 0 评论 -
4. Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1,原创 2017-09-13 08:43:50 · 146 阅读 · 0 评论