fanguzhai的博客

[勇者闯LeetCode] 257. Binary Tree PathsDescription Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \2 3 \ 5 All root-to-leaf pa

[勇者闯LeetCode] 136. Single NumberDescription Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime com

[勇者闯LeetCode] 125. Valid PalindromeDescription Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan, a can

[勇者闯LeetCode] 110. Balanced Binary TreeDescription Given 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 t

[勇者闯LeetCode] 108. Convert Sorted Array to Binary Search TreeDescription Given an array where elements are sorted in ascending order, convert it to a height balanced BST.InformationTags: Tree | Dep

[勇者闯LeetCode] 1. Two SumDescription Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one

[勇者闯LeetCode] 107. Binary Tree Level Order Traversal IIDescription Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from l

[勇者闯LeetCode] 118. Pascal’s TriangleDescription Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,

[勇者闯LeetCode] 112. Path SumDescription Given 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 ex

[勇者闯LeetCode] 111. Minimum Depth of Binary TreeDescription 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 t

[勇者闯LeetCode] 121. Best Time to Buy and Sell StockDescription Say you have an array for which the ithi^{th} element is the price of a given stock on day ii. If you were only permitted to complet

[勇者闯LeetCode] 155. Min StackeDescription Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) – Push element x onto stack. pop() – Remov

[勇者闯LeetCode] 129. Sum Root to Leaf NumberDescription Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1-

[勇者闯LeetCode] 169. Majority ElementDescription Given 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

[勇者闯LeetCode] 167. Two Sum II - Input array is sortedDescription Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target numb

[勇者闯LeetCode] 191. Number of 1 BitsDescription Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight). For example, the 32-b

[勇者闯LeetCode] 169. Majority ElementDescription Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return

[勇者闯LeetCode] 189. Rotate ArrayDescription Rotate an array of n elements to the right by k steps. For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Info

[勇者闯LeetCode] 142. Linked List Cycle IIDescription Given a linked list, return the node where the cycle begins. If there is no cycle, return null.InformationTags: Linked List | Two PointersDifficu

[勇者闯LeetCode] 141. Linked List CycleDescription Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?InformationTags: Linked List |

[勇者闯LeetCode] 160. Intersection of Two Linked ListsDescription Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked l

[勇者闯LeetCode] 70. Climbing StairsDescription You 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 c

[勇者闯LeetCode] 66. Plus OneDescription Given a non-negative integer represented as a non-empty array of digits, plus one to the integer. You may assume the integer do not contain any leading zero

[勇者闯LeetCode] 101. Symmetric TreeDescription Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symme

[勇者闯LeetCode] 7. Reverse IntegerDescription Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 Here are some good questions to ask before coding. B

[勇者闯LeetCode] 11. Container With Most WaterDescription 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 e

[勇者闯LeetCode] 6. ZigZag ConversionDescription 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

[勇者闯LeetCode] 38. Count and SayDescription The 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 r

[勇者闯LeetCode] 35. Search Insert PositionDescription 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

[勇者闯LeetCode] 28. Implement strStr()Description Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.InformationTags: Two

[勇者闯LeetCode] 9. Palindrome NumberDescription Determine whether an integer is a palindrome. Do this without extra space.InformationTags: MathDifficulty: EasySolutionclass Solution(object): de

[勇者闯LeetCode] 215. Kth Largest Element in an ArrayDescription Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct elem

[勇者闯LeetCode] 69. Sqrt(x)Description Implement int sqrt(int x). Compute and return the square root o xInformationTags: Binary Search | MatchDifficulty: EasyTips: 二分搜索 O(logN)Solutionclass Sol

[勇者闯LeetCode] 13. Roman to IntegerDescriptionGiven a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.InformationTags: Math | StringDifficulty: Easy

[勇者闯LeetCode] 14. Longest Common PrefixDescription Write a function to find the longest common prefix string amongst an array of strings.InformationTags: StringDifficulty: EasySolution列向扫描字符是否相同，

[勇者闯LeetCode] 88. Merge Sorted ArrayDescription Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume that nums1 has enough space (

[勇者闯LeetCode] 83. Remove Duplicates from Sorted ListDescription Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1

[勇者闯LeetCode] 58. Length of Last WordDescription Given 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

[勇者闯LeetCode] 53. Maximum SubarrayDescription Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,

[勇者闯LeetCode] 104. Maximum Depth of Binary TreeDescription Given 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