leetcode
zhutianyu_123
这个作者很懒,什么都没留下…
展开
-
leetcode 328 Odd Even Linked List(难易度:Easy)
Odd Even Linked ListGiven 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.原创 2016-02-10 20:41:03 · 372 阅读 · 0 评论 -
leetcode 202 Happy Number(难易度:Easy)
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原创 2015-09-17 09:35:20 · 298 阅读 · 0 评论 -
leetcode 070 Climbing Stairs(难易度:Easy)
Climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?代码:int clim原创 2015-09-16 10:42:54 · 232 阅读 · 0 评论 -
leetcode 206 Reverse Linked List(难易度:Easy)
Reverse Linked ListReverse a singly linked list.Hint:A linked list can be reversed either iteratively or recursively. Could you implement both?代码:/** * Definition for singly-linked li原创 2015-09-16 10:29:53 · 406 阅读 · 0 评论 -
leetcode 066 Plus One(难易度:Easy)
Plus OneGiven a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.代码:/*** R原创 2015-10-02 12:34:10 · 266 阅读 · 0 评论 -
leetcode 118 Pascal's Triangle(难易度:Easy)
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]]代码:/*原创 2015-10-05 12:14:24 · 304 阅读 · 0 评论 -
leetcode 232 Implement Queue using Stacks(难易度:Easy)
Implement Queue using Stacks原创 2015-09-16 09:44:27 · 244 阅读 · 0 评论 -
leetcode 101 Symmetric Tree
Symmetric TreeGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2015-09-29 10:41:34 · 249 阅读 · 0 评论 -
leetcode 013 Roman to Integer(难易度:Easy)
Roman to IntegerGiven a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.代码:int romanCharToInt(char c);int romanToInt(char* s){ int num =原创 2015-09-14 11:04:07 · 233 阅读 · 0 评论 -
leetcode 70 Climbing Stairs(难易度:Easy)
Climbing StairsYou are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?代码:int clim原创 2015-09-08 07:01:58 · 210 阅读 · 0 评论 -
leetcode 231 Power of Two(难易度:Easy)
Power of TwoGiven an integer, write a function to determine if it is a power of two.代码:bool isPowerOfTwo(int n) { return (n > 0) && (!(n &(n - 1)));}原题地址:https://leetcode.com/problems/power原创 2015-09-30 07:51:13 · 253 阅读 · 0 评论 -
leetcode 110 Balanced Binary Tree(难易度:Easy)
Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees o原创 2015-09-18 10:56:53 · 399 阅读 · 0 评论 -
leetcode 009 Palindrome Number(难易度:Easy)
Palindrome NumberDetermine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you ar原创 2015-12-08 11:11:22 · 272 阅读 · 0 评论 -
leetcode 112 Path Sum(难易度:Easy)
Path SumGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary t原创 2015-12-03 13:25:45 · 319 阅读 · 0 评论 -
leetcode 198 House Robber(难易度:Easy)
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 tha原创 2015-10-14 11:00:50 · 308 阅读 · 0 评论 -
leetcode 283 Move Zeroes(难易度:Easy)
Move ZeroesGiven an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after原创 2015-09-24 08:20:22 · 223 阅读 · 0 评论 -
leetcode 120 Triangle(难易度:Medium)
TriangleGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [原创 2015-09-23 16:16:39 · 342 阅读 · 0 评论 -
leetcode 292 Nim Game(难易度:Easy)
Nim GameYou are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone原创 2015-10-13 10:08:59 · 486 阅读 · 0 评论 -
leetcode 026 Remove Duplicates from Sorted Array(难易度:Easy)
Remove Duplicates from Sorted ArrayGiven a sorted array, remove the duplicates in place such that each element appear onlyonce and return the new length.Do not allocate extra space for another原创 2015-09-22 10:56:47 · 233 阅读 · 0 评论 -
leetcode 107 Binary Tree Level Order Traversal II(难易度:Easy)
Binary Tree Level Order Traversal IIGiven 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:原创 2015-10-23 08:25:26 · 299 阅读 · 0 评论 -
leetcode 102 Binary Tree Level Order Traversal(难易度:Easy)
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,#,原创 2015-10-07 16:35:49 · 265 阅读 · 0 评论 -
leetcode 083 Remove Duplicates from Sorted List(难易度:Easy)
Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, retur原创 2015-09-07 19:45:01 · 246 阅读 · 0 评论 -
leetcode 027 Remove Element(难易度:Easy)
Remove ElementGiven 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原创 2015-09-29 01:31:52 · 476 阅读 · 0 评论 -
leetcode 题解目录
leetcode 083 Remove Duplicates from Sorted List(难易度:Easy)leetcode 169 Majority Element(难易度:Easy)leetcode 217 Contains Duplicate(难易度:Easy)leetcode 226 Invert Binary Tree(难易度:Easy)原创 2015-09-06 11:53:27 · 256 阅读 · 0 评论 -
leetcode 234 Palindrome Linked List(难易度:Easy)
Palindrome Linked ListGiven 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. * stru原创 2015-08-30 14:00:41 · 336 阅读 · 0 评论 -
leetcode 136 Single Number(难易度:Easy)
Single NumberGiven 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 wi原创 2015-08-29 11:21:51 · 228 阅读 · 0 评论 -
leetcode 237 Delete Node in a Linked List(难易度:Easy)
Delete Node in a Linked ListWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are g原创 2015-08-26 21:54:33 · 253 阅读 · 0 评论 -
leetcode 160 Intersection of Two Linked Lists(难易度:Easy)
Intersection of Two Linked ListsWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: A: a1 → a2原创 2015-08-29 10:15:51 · 276 阅读 · 0 评论 -
leetcode 069 Sqrt(x)(难易度:Medium)
Sqrt(x)Implement int sqrt(int x).Compute and return the square root of x.代码:int mySqrt(int x) { if(x <= 0) return 0; int left = 1; int right = x; int ans; while原创 2015-08-29 10:00:44 · 352 阅读 · 0 评论 -
leetcode 235 Lowest Common Ancestor of a Binary Search Tree(难易度:Easy)
Lowest Common Ancestor of a Binary Search TreeGiven 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 Wiki原创 2015-08-28 13:49:00 · 483 阅读 · 0 评论 -
leetcode 058 Length of Last Word(难易度:Easy)
Length of Last WordGiven a string s consists of upper/lower-case alphabets and empty space characters' ', return the length of last word in the string.If the last word does not exist, return原创 2015-08-27 13:49:42 · 291 阅读 · 0 评论 -
leetcode 258 Add Digits(难易度:Easy)
Add DigitsGiven a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since原创 2015-08-26 22:15:00 · 312 阅读 · 0 评论 -
leetcode 264 Ugly Number II(难易度:Medium)
Ugly Number IIWrite a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example,1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequenc原创 2015-08-27 14:05:16 · 269 阅读 · 0 评论 -
leetcode 104 Maximum Depth of Binary Tree(难易度:Easy)
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.代码:/原创 2015-08-29 12:01:36 · 358 阅读 · 0 评论 -
leetcode 242 Valid Anagram(难易度:Easy)
Valid AnagramGiven two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false.N原创 2015-08-26 22:04:23 · 377 阅读 · 0 评论 -
leetcode 080 Remove Duplicates from Sorted Array II(难易度:Medium)
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 shoul原创 2015-09-26 10:19:09 · 251 阅读 · 0 评论 -
leetcode 217 Contains Duplicate(难易度:Easy)
Contains DuplicateGiven an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false原创 2015-09-05 20:23:28 · 233 阅读 · 0 评论 -
leetcode 169 Majority Element(难易度:Easy)
Majority ElementGiven an array of size n, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋ times.You may assume that the array is non-empty and the ma原创 2015-09-06 11:48:13 · 231 阅读 · 0 评论 -
leetcode 226 Invert Binary Tree(难易度:Easy)
Invert Binary TreeInvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this origin原创 2015-09-02 14:09:10 · 305 阅读 · 0 评论 -
leetcode 191 Number of 1 Bits(难易度:Easy)
Number of 1 BitsWrite a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as theHamming weight).For example, the 32-bit integer ’11' has binary repr原创 2015-09-01 13:39:46 · 280 阅读 · 0 评论