摘要：
Given a non-empty array of integers, return the k most frequent elements. For example,Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assum 阅读全文
posted @ 2017-12-13 02:35
逸朵
阅读(123)
评论(0)
推荐(0)
摘要：
The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each hou 阅读全文
posted @ 2017-12-12 06:33
逸朵
阅读(147)
评论(0)
推荐(0)
摘要：
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Your algorithm 阅读全文
posted @ 2017-12-10 13:55
逸朵
阅读(123)
评论(0)
推荐(0)
摘要：
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tick 阅读全文
posted @ 2017-12-10 12:30
逸朵
阅读(180)
评论(0)
推荐(0)
摘要：
One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, 阅读全文
posted @ 2017-12-10 10:22
逸朵
阅读(104)
评论(0)
推荐(0)
摘要：
Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n]inclusive can be form 阅读全文
posted @ 2017-12-10 02:55
逸朵
阅读(186)
评论(0)
推荐(0)
摘要：
Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... Example:(1) Given nums = [1, 5, 1, 1, 6, 4], one possible 阅读全文
posted @ 2017-12-09 12:22
逸朵
阅读(206)
评论(0)
推荐(0)
摘要：
Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + nfrom digits of the two. The 阅读全文
posted @ 2017-12-09 11:32
逸朵
阅读(286)
评论(0)
推荐(0)
摘要：
Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your 阅读全文
posted @ 2017-12-09 08:24
逸朵
阅读(149)
评论(0)
推荐(0)
摘要：
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smal 阅读全文
posted @ 2017-12-09 06:59
逸朵
阅读(114)
评论(0)
推荐(0)
浙公网安备 33010602011771号