leetcode
hahubaba
这个作者很懒,什么都没留下…
展开
-
!leetcode[153 & 154]:Find Minimum in Rotated Sorted Array I & II
Find Minimum 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).Find the minimum element.You may assume n原创 2015-06-26 16:56:20 · 241 阅读 · 0 评论 -
leetcode[198]:House Robber
House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adj原创 2015-07-25 16:39:37 · 286 阅读 · 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 O原创 2015-07-26 10:17:30 · 352 阅读 · 0 评论 -
leetcode[202]:Happy Number
Happy NumberWrite an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the原创 2015-07-25 16:01:14 · 242 阅读 · 0 评论 -
leetcode[224]:Basic Calculator
Basic Calculator Implement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integ原创 2015-07-26 13:50:49 · 315 阅读 · 0 评论 -
leetcode[103]:Binary Tree Zigzag Level Order Traversal
Binary Tree Zigzag Level Order Traversal Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate原创 2015-07-26 17:02:16 · 361 阅读 · 0 评论 -
leetcode[109]:Convert Sorted List to Binary Search Tree
Convert Sorted List to Binary Search TreeGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for singly-linked list. * struct原创 2015-07-26 19:17:36 · 287 阅读 · 0 评论 -
leetcode[150]:Evaluate Reverse Polish Notation
Evaluate Reverse Polish NotationEvaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examp原创 2015-07-26 10:47:47 · 245 阅读 · 0 评论 -
leetcode[199]:Binary Tree Right Side View
Binary Tree Right Side ViewGiven 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 followin原创 2015-07-26 17:55:42 · 278 阅读 · 0 评论 -
leetcode[137]:Single Number II
Single Number IIGiven 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原创 2015-07-25 14:27:44 · 274 阅读 · 0 评论 -
leetcode[111]:Minimum Depth of Binary Tree
Minimum Depth of Binary Tree Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node./** * Definit原创 2015-06-15 19:35:01 · 208 阅读 · 0 评论 -
leetcode[108]:Convert Sorted Array to Binary Search Tree
Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for a binary tree node. * struct TreeNode {原创 2015-07-26 19:07:40 · 381 阅读 · 0 评论 -
leetcode[24]:Swap Nodes in Pairs
Swap Nodes in PairsGiven a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constan原创 2015-07-26 19:44:38 · 268 阅读 · 0 评论 -
leetcode[116]:Populating Next Right Pointers in Each Node
Populating Next Right Pointers in Each NodeGiven a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to point to its next原创 2015-07-26 15:58:56 · 235 阅读 · 0 评论 -
leetcode[223]:Rectangle Area
Rectangle Area#define min(a,b)(a<b?a:b)#define max(a,b)(a>b?a:b)int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int area1,area2,area3; area1 = (C-A) * (D-B); are原创 2015-06-12 21:00:37 · 186 阅读 · 0 评论 -
leetcode[204]:Count Primes
Count PrimesDescription:Count the number of prime numbers less than a non-negative number, n.Credits: Special thanks to @mithmatt for adding this problem and creating all test cases.Hint:Let’s start转载 2015-06-13 15:53:57 · 240 阅读 · 0 评论 -
leetcode[96]:Unique Binary Search Trees
Unique Binary Search TreesGiven n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST’s. 1 3 3原创 2015-07-26 18:25:12 · 295 阅读 · 0 评论 -
leetcode[205]:Isomorphic Strings
Isomorphic StringsGiven two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced原创 2015-07-25 15:36:30 · 255 阅读 · 0 评论 -
leetcode[227]:Basic Calculator II
Basic Calculator II Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer di原创 2015-07-26 15:24:38 · 320 阅读 · 0 评论 -
leetcode[80]:Remove Duplicates from Sorted Array II
Remove Duplicates from Sorted Array IIFollow up for “Remove Duplicates“: What if duplicates are allowed at most twice?For example, Given sorted array nums = [1,1,1,2,2,3],Your function should return原创 2015-07-26 19:35:42 · 300 阅读 · 0 评论 -
leetcode[86]:Partition List
Partition ListGiven a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes i原创 2015-07-26 21:26:39 · 293 阅读 · 0 评论 -
leetcode[234]:Palindrome Linked List
Palindrome Linked List Given a singly linked list, determine if it is a palindrome.Follow up: Could you do it in O(n) time and O(1) space?/** * Definition for singly-linked list. * struct ListNode {原创 2015-07-14 11:09:21 · 255 阅读 · 0 评论 -
leetcode[190]:Reverse Bits
Reverse BitsReverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00原创 2015-07-14 14:02:01 · 339 阅读 · 0 评论 -
leetcode[107]:Binary Tree Level Order Traversal II
Binary Tree Level Order Traversal II Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).For example: Giv原创 2015-07-20 14:37:50 · 219 阅读 · 0 评论 -
leetcode[145]:Binary Tree Postorder Traversal
Binary Tree Postorder Traversal Given a binary tree, return the postorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].Note: Re原创 2015-07-20 21:28:22 · 337 阅读 · 0 评论 -
leetcode[144]:Binary Tree Preorder Traversal
Binary Tree Preorder TraversalGiven 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: Recursi原创 2015-07-20 20:15:58 · 246 阅读 · 0 评论 -
leetcode[118]:Pascal's Triangle
Pascal’s TriangleGiven numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1]]/** * Return an原创 2015-07-21 10:13:09 · 267 阅读 · 0 评论 -
leetcode[119]:Pascal's Triangle II
Pascal’s Triangle IIGiven an index k, return the kth row of the Pascal’s triangle.For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? /原创 2015-07-21 10:44:27 · 263 阅读 · 0 评论 -
leetcode[94]:Binary Tree Inorder Traversal
Binary Tree Inorder TraversalGiven 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原创 2015-07-20 22:50:33 · 202 阅读 · 0 评论 -
leetcode[14]:Longest Common Prefix
Longest Common PrefixWrite a function to find the longest common prefix string amongst an array of strings.char* longestCommonPrefix(char** strs, int strsSize) { int i,j,flag=0; char *res;原创 2015-07-21 16:11:48 · 192 阅读 · 0 评论 -
!leetcode[74&240]:Search a 2D Matrix I &II
Search a 2D MatrixWrite 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 from left to right. •The first in原创 2015-07-23 11:03:26 · 289 阅读 · 0 评论 -
leetcode[102]:Binary Tree Level Order Traversal
Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree {3,9,20,#,#,15,7},原创 2015-07-19 22:09:03 · 309 阅读 · 0 评论 -
leetcode[236]:Lowest Common Ancestor of a Binary Tree
Lowest Common Ancestor of a Binary TreeGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ance原创 2015-07-19 14:52:01 · 246 阅读 · 0 评论 -
leetcode[235]:Lowest Common Ancestor of a Binary Search Tree
Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.According to the definition of LCA on Wikipedia: “Th原创 2015-07-19 14:17:39 · 268 阅读 · 0 评论 -
leetcode[7]:Reverse Integer
Reverse IntegerReverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321click to show spoilers.Have you thought about this? Here are some good questions to ask before原创 2015-07-14 14:33:40 · 212 阅读 · 0 评论 -
leetcode[8]:String to Integer (atoi)
String to Integer (atoi) 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 t原创 2015-07-14 16:25:30 · 537 阅读 · 0 评论 -
leetcode[125]:Valid Palindrome
Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car原创 2015-07-14 10:28:32 · 180 阅读 · 0 评论 -
leetcode[231]:Power of Two
Power of TwoGiven an integer, write a function to determine if it is a power of two.是2的整数次幂问题,很容易想到位操作。看到了Discuss中某大神的做法,十分膜拜: https://leetcode.com/discuss/44155/1-line-python-solution 转换成C语言如下:bool原创 2015-07-07 20:07:00 · 280 阅读 · 0 评论 -
leetcode[38]:Count and Say
Count and SayThe count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off a原创 2015-07-14 22:57:38 · 162 阅读 · 0 评论 -
leetcode[230]:Kth Smallest Element in a BST
Kth Smallest Element in a BSTGiven a binary search tree, write a function kthSmallest to find the kth smallest element in it.Note: You may assume k is always valid, 1 ≤ k ≤ BST’s total elements.Foll原创 2015-07-28 21:34:10 · 356 阅读 · 0 评论