LeetCode
文章平均质量分 56
未闻小然桑
咱的目标是星辰大海。。。
展开
-
LeetCode No334. Increasing Triplet Subsequence
1. 问题描述Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should: Return true if there exists i, j, k such that arr[i] <原创 2016-05-27 22:18:08 · 320 阅读 · 0 评论 -
LeetCode No330. Patching Array
1. 题目描述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 formed by the sum of some elements in the ar原创 2016-06-10 14:02:50 · 308 阅读 · 0 评论 -
LeetCode No336. Palindrome Pairs
1. 题目描述Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] is a palindrome.Example 1: Given原创 2016-05-22 22:45:47 · 429 阅读 · 0 评论 -
LeetCode No.337. House Robber III
1. 题目描述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 house has one and only one parent house. Aft原创 2016-05-22 22:23:33 · 296 阅读 · 0 评论 -
LeetCode No332. Reconstruct Itinerary
1. 题目描述Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Th原创 2016-06-04 15:47:54 · 417 阅读 · 0 评论 -
Graph的那些事儿
0. 导言为了让代码更加清晰,有以下一些约定:Graph的表示使用邻接表,更详细的说明参见 图的表示本文代码中使用的图为 有向图,图中的顶点用 int 型来表示图的顶点数经初始化后不可变,图的初始化有以下两种形式Graph(int verCount);Graph(String filename);其中文件内容为:100 // 顶点数1000 //边数52 59 // 以下每一行代表一原创 2016-05-30 17:09:32 · 694 阅读 · 0 评论 -
LeetCode No338. Counting Bits
1. 题目描述Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example: For nu原创 2016-05-19 10:49:39 · 344 阅读 · 0 评论 -
LeetCode No344. Reverse String
1. 题目描述Write a function that takes a string as input and returns the string reversed.Example: Given s = “hello”, return “olleh”.2. 初步思路直接使用标准库reverse函数3. 初步算法class Solution {public: string revers原创 2016-05-12 11:05:11 · 250 阅读 · 0 评论 -
LeetCode No343. Integer Break
1. 题目描述Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, r原创 2016-05-13 11:41:08 · 297 阅读 · 0 评论 -
LeetCode No342. Power of Four
1. 题目描述Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without l原创 2016-05-13 12:09:00 · 307 阅读 · 0 评论 -
LeetCode No341. Flatten Nested List Iterator
1. 题目描述Given a nested list of integers, implement an iterator to flatten it.Each element is either an integer, or a list – whose elements may also be integers or other lists.Example 1: Given the list原创 2016-05-14 13:14:23 · 404 阅读 · 0 评论 -
LeetCode No345. Reverse Vowels of a String
1. 题目描述Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.2. 初步算法cla原创 2016-05-12 10:59:46 · 308 阅读 · 0 评论 -
LeetCode No347. Top K Frequent Elements
1. 题目描述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 assume k is always valid, 1 ≤ k ≤ number of uni原创 2016-05-12 10:38:39 · 300 阅读 · 0 评论 -
LeetCode No331. Verify Preorder Serialization of a Binary Tree
1. 题目描述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, we record using a sentinel value such as原创 2016-06-06 23:09:30 · 279 阅读 · 0 评论