LeetCode
文章平均质量分 70
yunwu753
这个作者很懒,什么都没留下…
展开
-
[LeetCode 206] Reverse Linked List
Reverse a singly linked list.click to show more hints.Hint:A linked list can be reversed either iteratively or recursively. Could you implement both?单链表的原地逆置,需要记录三个数据,当前节点、前一个节点、后一个节点。/*原创 2015-08-11 14:53:43 · 201 阅读 · 0 评论 -
[LeetCode 22] Generate Parentheses
原文地址:http://www.cnblogs.com/codingmylife/archive/2012/09/09/2677428.html还有:http://blog.csdn.net/yutianzuijin/article/details/13161721Given n pairs of parentheses, write a function to generate转载 2015-08-28 09:23:14 · 583 阅读 · 0 评论 -
[LeetCode 49] Group Anagrams
原文地址:http://blog.csdn.net/kangrydotnet/article/details/47777545Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[转载 2015-08-27 16:37:17 · 280 阅读 · 0 评论 -
[LeetCode 17]
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2015-08-27 17:58:03 · 83 阅读 · 0 评论 -
[LeetCode 242] Valid Anagram
原文地址:http://blog.csdn.net/flyljg/article/details/47206043思路:两种方法,sort()排序一种方法;另一种计数器解决。代码实现:解法一:排序之后判断相等[html] view plaincopyclass Solution { public:转载 2015-08-03 16:23:24 · 166 阅读 · 0 评论 -
[LeetCode 235] Lowest Common Ancestor of a Binary Search Tree
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas原创 2015-08-04 17:41:00 · 159 阅读 · 0 评论 -
[LeetCode 231] Power of Two
Given an integer, write a function to determine if it is a power of two.要考虑初始值为0或1的情况class Solution {public: bool isPowerOfTwo(int n) { if(n==0) return false; if(n原创 2015-08-04 19:16:08 · 160 阅读 · 0 评论 -
[LeetCode 228] Summary Ranges
原文地址:http://blog.csdn.net/sunao2002002/article/details/46653021Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2转载 2015-08-04 20:22:31 · 164 阅读 · 0 评论 -
[LeetCode 121] Best Time to Buy and Sell Stock
原文地址:http://blog.csdn.net/xshalk/article/details/8150465Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most on转载 2015-08-17 14:19:28 · 182 阅读 · 0 评论 -
[LeetCode 232] Implement Queue using Stacks
原文地址:http://blog.csdn.net/sunao2002002/article/details/46793425Implement the following operations of a queue using stacks.push(x) -- Push element x to the back of queue.pop() -- Removes the el转载 2015-08-04 19:08:02 · 151 阅读 · 0 评论 -
[LeetCode 17] Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit st原创 2015-08-28 11:38:55 · 223 阅读 · 0 评论 -
Multiply Strings
class Solution {public: string multiply(string num1, string num2) { int c; int len1=num1.size(); int len2=num2.size(); int i,j,k; vector > r; strin原创 2015-08-26 22:54:47 · 65 阅读 · 0 评论 -
[LeetCode 71] Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did原创 2015-08-26 14:09:37 · 193 阅读 · 0 评论 -
[LeetCode 74] Search a 2D Matrix
原文地址:http://blog.csdn.net/lanxu_yy/article/details/17261035题目:Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Inte转载 2015-08-12 16:43:23 · 174 阅读 · 0 评论 -
[LeetCode 222] Count Complete Tree Nodes
原文地址:http://blog.csdn.net/brucehb/article/details/46448503Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary t转载 2015-08-12 19:13:53 · 166 阅读 · 0 评论 -
[LeetCode 224] Basic Calculator
原文地址:http://www.cnblogs.com/ganganloveu/p/4640589.htmlBasic CalculatorImplement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closi转载 2015-08-12 15:56:48 · 187 阅读 · 0 评论 -
[LeetCode 93] Restore IP Addresses
原文地址:http://www.tuicool.com/articles/MBBvuu这里还有一篇:http://blog.csdn.net/doc_sgl/article/details/12351489Given a string containing only digits, restore it by returning all possible valid IP addr转载 2015-08-27 11:16:56 · 258 阅读 · 0 评论 -
[LeetCode 240] Search a 2D Matrix II
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right.Integers in原创 2015-08-12 17:42:19 · 186 阅读 · 0 评论 -
[LeetCode 173] Binary Search Tree Iterator
原文地址:http://blog.csdn.net/doc_sgl/article/details/42372251Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() wi转载 2015-08-12 09:45:27 · 223 阅读 · 0 评论 -
[LeetCode 221] Maximal Square (好好思考下)
原文地址:http://blog.csdn.net/brucehb/article/details/46384411Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given th转载 2015-08-13 17:22:05 · 172 阅读 · 0 评论 -
[LeetCode 3] Longest Substring Without Repeating Characters
原文地址:http://www.cnblogs.com/dollarzhaole/p/3155712.htmlGiven a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating l转载 2015-08-27 14:38:47 · 239 阅读 · 0 评论 -
[LeetCode 122] 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转载 2015-08-18 09:38:47 · 177 阅读 · 0 评论 -
[LeetCode 151] Reverse Words in a String
Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".Update (2015-02-12):For C programmers: Try to solve it in-place in原创 2015-09-01 11:21:28 · 186 阅读 · 0 评论 -
[LeetCode 225] Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet原创 2015-08-05 19:01:48 · 184 阅读 · 0 评论 -
[LeetCode 136] Single Number
原文地址:http://blog.csdn.net/magisu/article/details/13169283Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear转载 2015-08-20 17:32:28 · 190 阅读 · 0 评论 -
[LeetCode 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原创 2015-09-07 10:17:55 · 208 阅读 · 0 评论 -
[LeetCode 131] Palindrome Partitioning
原文地址:http://blog.csdn.net/zhanghaodx082/article/details/24184195题目大意:Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome p转载 2015-08-20 15:25:28 · 195 阅读 · 0 评论 -
[LeetCode 78] Subsets
原文地址:http://www.cnblogs.com/felixfang/p/3775712.htmlGiven a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solu转载 2015-08-21 14:53:28 · 163 阅读 · 0 评论 -
[LeetCode 94] Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solutio原创 2015-09-22 11:12:32 · 207 阅读 · 0 评论 -
[LeetCode 144] Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti原创 2015-09-22 10:08:46 · 214 阅读 · 0 评论 -
[LeetCode 108] Convert Sorted Array to Binary Search Tree
原文地址:http://blog.csdn.net/magisu/article/details/15025037Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for a binary tree node.转载 2015-09-22 19:28:45 · 223 阅读 · 0 评论 -
[LeetCode 236] Lowest Common Ancestor of a Binary Tree
原文地址:http://www.cnblogs.com/easonliu/p/4643873.htmlGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “T转载 2015-09-22 18:06:09 · 227 阅读 · 0 评论 -
[LeetCode 199] Binary Tree Right Side View
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:Given the following binary tree, 1原创 2015-09-22 18:44:14 · 221 阅读 · 0 评论 -
[LeetCode 137] Single Number II
原文地址:http://blog.csdn.net/jiadebin890724/article/details/23306837Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm sh转载 2015-08-21 10:09:26 · 261 阅读 · 0 评论 -
[LeetCode 260] Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given原创 2015-08-21 10:48:16 · 224 阅读 · 0 评论 -
[LeetCode 179] Largest Number
原文地址:http://www.w2bc.com/Article/19411Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number转载 2015-08-18 14:49:20 · 205 阅读 · 0 评论 -
[LeetCode 230] Kth Smallest Element in a BST
原文地址:http://blog.csdn.net/brucehb/article/details/46734301iven a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always vali转载 2015-08-18 16:09:21 · 163 阅读 · 0 评论 -
[LeetCode 187] Repeated DNA Sequences
原文地址:http://www.cnblogs.com/grandyang/p/4284205.htmlAll DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes usef转载 2015-08-18 15:48:41 · 210 阅读 · 0 评论 -
[LeetCode 229] Majority Element II
原文地址:http://www.cnblogs.com/ZhangYushuang/p/4627503.htmlGiven an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(转载 2015-08-18 16:55:49 · 177 阅读 · 0 评论 -
[LeetCode 223] Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the tota转载 2015-08-05 20:15:03 · 168 阅读 · 0 评论