Leetcode
文章平均质量分 55
nanphonfy
专心、专注、专业。
展开
-
Best Time to Buy and Sell Stock
Say 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 one transaction (ie, buy one and sell one share of the stock), d原创 2015-05-10 23:01:45 · 414 阅读 · 0 评论 -
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: “The lowest common ancestor is defined between two原创 2015-07-13 00:02:42 · 451 阅读 · 0 评论 -
Search Insert Position
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 order.You may assume no duplicates in the array.Here原创 2015-07-13 18:44:50 · 450 阅读 · 0 评论 -
Remove Duplicates from Sorted List I,II
Remove Duplicates from Sorted List Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, ret原创 2015-09-09 12:39:10 · 846 阅读 · 0 评论 -
Product of Array Except Self
Product of Array Except Self Tota Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it原创 2015-09-09 16:03:12 · 458 阅读 · 0 评论 -
Roman to Integer
Roman to Integer Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.Hide Tags Math StringHide Similar Problems (M) Inte原创 2015-09-11 08:07:12 · 550 阅读 · 0 评论 -
Maximum Subarray
Maximum Subarray Difficulty: Medium 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,1,−5,4], the原创 2015-09-12 10:01:54 · 398 阅读 · 0 评论 -
Integer to Roman
Integer to Roman Difficulty: Medium Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.Hide Tags Math String Hide Similar Problems (E) Roman t原创 2015-09-14 11:09:17 · 540 阅读 · 0 评论 -
UVA 445 - Marvelous Mazes
题目大意:原创 2014-08-23 22:31:20 · 575 阅读 · 0 评论 -
Implement Queue using Stacks
Implement Queue using Stacks Difficulty: Easy Implement the following operations of a queue using stacks.push(x) – Push element x to the back of queue. pop() – Removes the element from in front of原创 2015-09-14 21:56:45 · 501 阅读 · 0 评论 -
Add Digits
Add Digits Difficulty: Easy Given 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原创 2015-09-15 06:57:16 · 447 阅读 · 0 评论 -
Binary Tree Level Order Traversal II
Binary Tree Level Order Traversal II Total Accepted: 52355 Total Submissions: 167541 Difficulty: EasyGiven a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from lef原创 2015-09-16 14:50:42 · 476 阅读 · 0 评论 -
Gray Code
Gray CodeMy SubmissionsQuestion Solution The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing原创 2015-10-15 16:25:34 · 466 阅读 · 0 评论 -
Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product【乘积】 of all the elements of nums except nums[i].Solve it without division【除法】 an原创 2015-12-16 01:05:08 · 409 阅读 · 0 评论 -
Contains Duplicate
Given 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 if every element is原创 2015-05-27 10:22:05 · 412 阅读 · 0 评论 -
Count and Say
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 read off as "two 1s" or 21.21 is read off as原创 2015-05-13 11:49:41 · 521 阅读 · 0 评论 -
Majority Element
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 the array is non-empty and the majority elem原创 2015-05-11 20:04:45 · 404 阅读 · 0 评论 -
Length of Last Word
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 word does not exist, return 0.Note: A word is原创 2015-05-11 00:21:55 · 411 阅读 · 0 评论 -
Same Tree
Given 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 value.通过比较树的过程【图原创 2015-05-15 15:01:56 · 425 阅读 · 0 评论 -
Unique Binary Search Trees
Given 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 Tree Dynamic Programming 题解: Unique Binary Se原创 2015-05-27 13:16:34 · 571 阅读 · 0 评论 -
Single Number
Single Number Question Solution Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime comp原创 2015-05-09 23:46:59 · 408 阅读 · 0 评论 -
Maximum Depth of Binary Tree
Maximum Depth of Binary Tree 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 the farthest leaf node.原创 2015-05-09 20:09:42 · 543 阅读 · 0 评论 -
Remove Nth Node From End of List
Remove Nth Node From End of List Total Accepted: 51701 Total Submissions: 188253My SubmissionsQuestion Solution Given a linked list, remove the nth node from the end of list and原创 2015-05-09 00:14:37 · 541 阅读 · 0 评论 -
Populating Next Right Pointers in Each Node
Given a binary treestruct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next;}Populate each next pointer to point to its next right node. If there is no next right node,原创 2015-05-28 15:38:56 · 452 阅读 · 0 评论 -
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 / 3 return [1,2,3].Note: Recursive solution is trivial,原创 2015-05-22 15:33:35 · 456 阅读 · 0 评论 -
Number of 1 Bits
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-bit integer ’11' has binary representation 00000000原创 2015-05-19 08:32:32 · 462 阅读 · 0 评论 -
Isomorphic Strings
Given 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 with anot原创 2015-05-12 23:21:08 · 430 阅读 · 0 评论 -
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-05-19 00:13:16 · 530 阅读 · 0 评论 -
Excel Sheet Column Number
Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 Math分析:A原创 2015-05-19 16:54:13 · 477 阅读 · 0 评论 -
Valid Palindrome
Given 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" is not a原创 2015-05-11 12:22:50 · 471 阅读 · 0 评论