leetcode
hr_whisper
来自Fzu12级学生,喜欢编程。
新blog地址: www.hrwhisper.me
展开
-
leetcode Count of Smaller Numbers After Self
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 smaller elements to the right of nums[i].Example转载 2015-12-07 07:32:15 · 2456 阅读 · 0 评论 -
leetcode Reconstruct Itinerary
leetcode Reconstruct ItineraryGiven 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转载 2016-02-06 23:34:47 · 3093 阅读 · 1 评论 -
leetcode Count of Range Sum
Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the sum of the elements in nums between indices i and j (i ≤ j),转载 2016-01-11 09:48:25 · 3224 阅读 · 0 评论 -
leetcode Remove Duplicate Letters
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 result is the smallest in lexicographical order a转载 2015-12-09 21:12:36 · 1460 阅读 · 0 评论 -
leetcode Create Maximum Number
Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k from digits of the two. The relative order of the digits from the same array mus转载 2015-12-24 09:43:13 · 2255 阅读 · 0 评论 -
leetcode Coin Change
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money转载 2015-12-27 11:46:03 · 2795 阅读 · 0 评论 -
leetcode Patching Array
题意:给定一个数组nums和一个数n,求添加最少的数使得[1,n]中的每个数都可以由数组中元素和组成用known_sum表示已知的连续和为[1,known_sum),有了这个表示那就简单了:nums[i] nums[i] > known_sum, 添加known_sum进数组才能达到最大的范围,所以已知范围更新为:[1,known_sum *2 )转载 2016-01-27 20:07:29 · 1908 阅读 · 0 评论 -
leetcode Power of Three
Given an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?方法一:class Solution {public: bool isPowerOfTh转载 2016-01-08 14:20:22 · 1359 阅读 · 0 评论 -
leetcode Longest Increasing Path in a Matrix
题意:给定一个矩阵,在里面找出最大上升路径int dx[] = { 1 , -1, 0 , 0 };int dy[] = { 0 , 0 , 1 , -1 };class Solution {public: int dfs(int x, int y, const int &m,const int &n,vector>& matrix, vector>& dis) { if (di转载 2016-01-20 18:34:35 · 1281 阅读 · 0 评论 -
leetcode Wiggle Sort II
Given an unsorted array nums, reorder it such that nums[0] nums[2] .Example:(1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is [1, 4, 1, 5, 1, 6]. (2) Given nums = [1, 3, 2, 2, 3转载 2016-01-01 11:23:43 · 2793 阅读 · 0 评论 -
leetcode Maximum Product of Word Lengths
Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case le转载 2015-12-16 09:28:16 · 687 阅读 · 0 评论 -
leetcode Odd Even Linked List
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do it in转载 2016-01-16 13:09:36 · 749 阅读 · 0 评论 -
leetcode Best Time to Buy and Sell Stock with Cooldown
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy转载 2015-11-27 18:17:11 · 1774 阅读 · 0 评论 -
leetcode Increasing Triplet Subsequence
leetcode Increasing Triplet SubsequenceGiven an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should:Return true if t转载 2016-02-16 14:20:05 · 917 阅读 · 0 评论