oYinGui1

LeetCode OJ-129.Sum Root to Leaf Numbers题目描述 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->2->3 whi

LeetCode OJ-2.Add Two Numbers题目描述 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digi

LeetCode OJ-78.Subsets题目描述 Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,3],

LeetCode OJ-77.Combinations题目描述 Given two integers n and k, return all possible combinations of k numbers out of 1 … n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4]

LeetCode OJ-74.Search a 2D Matrix题目描述 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 from

LeetCode OJ-55.Jump Game题目描述 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length

LeetCode OJ-49.Group Anagrams题目描述 Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"],  Return: [ ["ate", "eat","tea"],

LeetCode OJ-46.Permutations(全排列问题)题目描述 Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3

LeetCode OJ-16.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

LeetCode OJ-15.3Sum(三数和问题)问题描述 Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: T

LeetCode OJ-11.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 o

LeetCode OJ-6.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 le

LeetCode OJ-19.Remove Nth Node From End of List题目描述 Given a linked list, remove the *n*th node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, an

LeetCode OJ-34.Search for a Range题目描述 Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm’s runtime complexity mus

LeetCode OJ-419.Battleships in a Board题目描述 Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may assume th

LeetCode OJ-537.Complex Number Multiplication题目描述 Given two strings representing two complex numbers. You need to return a string representing their multiplication. Note i2 = -1 according to the

LeetCode OJ-4.Median of Two Sorted Arrays题目描述 There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity

LeetCode OJ-560.Subarray Sum Equals K题目描述 Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k. Example 1: Input:nums

LeetCode OJ-392.Is Subsequence题目描述 Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is potentially

LeetCode OJ-513.Find Bottom Left Tree Value题目描述 Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: 2 / \ 1 3Output:1 Example 2:

LeetCode OJ-338.Counting Bits题目描述 Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as a

LeetCode OJ-14.Longest Common Prefix题目描述 Write a function to find the longest common prefix string amongst an array of strings. Subscribe to see which companies asked this question. Show Ta

LeetCode OJ-20.Valid Parentheses题目描述 Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct

LeetCode OJ-3.Longest Substring Without Repeating Characters(最长无重复子串)题目描述 3. Longest Substring Without Repeating Characters Add to List QuestionEditorial Solution My Submissions

LeetCode OJ-22.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:

DNA SortingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3088    Accepted Submission(s): 1529Problem DescriptionOne measure of

283. 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,

226. Invert Binary TreeInvert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1实际上就是将节点的左右子树交换位置，代码如下：/** * Definiti

104. 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

258. 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

LeetCode OJ-292. 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 rem

Text ReverseTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25953    Accepted Submission(s): 10068Problem DescriptionIgnatius li

Number SequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 144163    Accepted Submission(s): 35045Problem Description：A number seq

Write a simple HTML BrowserTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10513    Accepted Submission(s): 3030Problem Description

Word AmalgamationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3425    Accepted Submission(s): 1686Problem DescriptionIn milli

169. 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-em

100. Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same

LeetCode OJ-18.4Sum(四数和)题目描述 Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of t

hdu-1029 Ignatius and the Princess IV题目描述 Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 28646    Accepted S

190. Reverse BitsReverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented