算法
文章平均质量分 67
ezzffzz
这个作者很懒,什么都没留下…
展开
-
leetcode_Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe原创 2014-05-11 14:26:19 · 356 阅读 · 0 评论 -
leetcode_String to interger
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca原创 2014-05-11 15:09:05 · 320 阅读 · 0 评论 -
leetcode_Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link原创 2014-05-11 14:57:35 · 332 阅读 · 0 评论 -
8_leetcode_ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I原创 2014-06-04 08:22:06 · 398 阅读 · 0 评论 -
6_leetcode_Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space1原创 2014-06-04 08:15:37 · 382 阅读 · 0 评论 -
7_leetcode_container with most water
Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin原创 2014-06-04 08:18:36 · 467 阅读 · 0 评论 -
leetcode_Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321//1:z原创 2014-06-04 07:09:31 · 393 阅读 · 0 评论 -
102_leetcode_Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \ gr原创 2014-06-23 13:59:00 · 372 阅读 · 0 评论 -
109_leetcode_Longest Consecutive Sequence
int longestConsecutive(vector &num) { int size = (int)num.size(); if(size <= 1) { return size; } int maxValue = 0; uno原创 2014-06-24 08:05:23 · 289 阅读 · 0 评论 -
112_leetcode_Binary Tree Maximum Path
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3Return 6.1原创 2014-06-24 11:47:14 · 424 阅读 · 0 评论 -
114_leetcode_Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2014-06-24 15:26:41 · 432 阅读 · 0 评论 -
115_leetcode_Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3原创 2014-06-24 16:00:15 · 301 阅读 · 0 评论 -
106_leetcode_Largest Rectangle in Histogram
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where width o原创 2014-06-23 17:51:16 · 414 阅读 · 0 评论 -
108_leetcode_reverse Words
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".原创 2014-06-24 07:46:04 · 327 阅读 · 0 评论 -
113_Restore IP Addresses
vector restoreIpAddresses(string s) { vector result; if(s.size() 12) return result; if((s.size() == 12 && s[0] > '2')) return result;原创 2014-06-24 14:57:51 · 285 阅读 · 0 评论 -
9_leetcode_remove Nth Node from End
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the原创 2014-06-04 22:03:37 · 404 阅读 · 0 评论 -
10_leetcode_Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va原创 2014-06-04 22:08:43 · 329 阅读 · 0 评论 -
leetcode_Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.//1原创 2014-06-04 08:11:36 · 432 阅读 · 0 评论 -
13_leetcode_3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact原创 2014-06-05 08:12:05 · 351 阅读 · 0 评论 -
19_leetcode_Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in原创 2014-06-05 23:15:19 · 364 阅读 · 0 评论 -
21_leetcode_Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). If the原创 2014-06-05 23:20:04 · 289 阅读 · 0 评论 -
107_leetcode_maxmal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area1:特殊情况;2: int largestRectangleArea(vector &height) { if(hei原创 2014-06-23 18:02:49 · 409 阅读 · 0 评论 -
116_leetcode_Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative.1:特殊情况;2:设置数组,字符串xiang che str原创 2014-06-24 16:59:38 · 289 阅读 · 0 评论 -
117_leetcode_Candy
There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on原创 2014-06-25 09:37:08 · 338 阅读 · 0 评论 -
118_leetcode_Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab",Return [ ["aa","b"],原创 2014-06-25 09:51:51 · 304 阅读 · 0 评论 -
103_leetcode_Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using ext原创 2014-06-23 14:02:36 · 337 阅读 · 0 评论 -
105_leetcode_interleaving string
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", ret原创 2014-06-23 17:17:09 · 362 阅读 · 0 评论 -
106_leetcode_largest Rectangle in Histogram
int largestRectangleArea(vector &height) { if(height.size() == 0) { return 0; } int size = (int)height.size(); stack myStack; i原创 2014-06-23 18:05:42 · 319 阅读 · 0 评论 -
104_leetcode_Single NumberII
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without u原创 2014-06-23 14:22:56 · 357 阅读 · 0 评论 -
16_leetcode_swap node in pairs
1:链表为NULLhuo z原创 2014-06-05 08:23:33 · 415 阅读 · 0 评论 -
11_leetcode_Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.1.考虑zi fu shu zu原创 2014-06-05 08:06:10 · 285 阅读 · 0 评论 -
14_leetcode_fourSum
1.数组中元素ge shu原创 2014-06-05 08:15:00 · 382 阅读 · 0 评论 -
15_leetcode_Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:1: n原创 2014-06-05 08:19:43 · 354 阅读 · 0 评论 -
110_leetcode_Best Time to Buy and sell Stock II
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 on原创 2014-06-24 11:08:56 · 899 阅读 · 0 评论 -
111_leetcode_Best Time to Buy and Sell Stock III
int maxProfit(vector &prices) { if(prices.size() <= 1) { return 0; } int size = (int)prices.size(); vector leftProfit(size, 0);原创 2014-06-24 11:30:44 · 849 阅读 · 0 评论 -
18_leetcode_remove Element
Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn't matter what you leave beyond the new le原创 2014-06-05 23:14:06 · 373 阅读 · 0 评论 -
20_leetcode_Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found原创 2014-06-05 23:17:45 · 312 阅读 · 0 评论 -
12_leetcode_3Sum
1.数组的个数小于3;2.对数组进行升序排序;3.从前往后bian li原创 2014-06-05 08:09:27 · 283 阅读 · 0 评论 -
17_leetcode_merge k Sorted List
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.1:原创 2014-06-05 08:29:02 · 979 阅读 · 0 评论 -
22_leetcode_Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in原创 2014-06-05 23:21:51 · 304 阅读 · 0 评论