Leetcode
文章平均质量分 71
yongfengsite
这个作者很懒,什么都没留下…
展开
-
[leetcode 467]Unique Substrings in Wraparound String
Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".Now we ha原创 2016-12-08 15:28:14 · 790 阅读 · 0 评论 -
[leetcode 274 275]H-Index I II
274:Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.According to the definition of h-index on Wikipedia:原创 2015-09-06 16:58:21 · 655 阅读 · 0 评论 -
[leetcode 279]Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =原创 2015-09-11 09:50:12 · 886 阅读 · 0 评论 -
[leetcode 97]Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc", r原创 2015-07-30 15:57:45 · 507 阅读 · 0 评论 -
[leetcode 241]Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *.Example 1I原创 2015-08-06 20:26:11 · 871 阅读 · 0 评论 -
[leetcode 240]Search a 2D Matrix II
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 in ascending from left to right.Integers in原创 2015-08-07 11:22:51 · 600 阅读 · 0 评论 -
[leetcode 230]Kth Smallest Element in a BST
Given 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.Follow up:What if the原创 2015-08-09 11:13:25 · 760 阅读 · 0 评论 -
[leetcode 229]Majority Element II
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.Hint:How many majority elements could it possibly原创 2015-08-10 15:28:00 · 618 阅读 · 0 评论 -
[leetcode 220]Contains Duplicate III
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i an原创 2015-09-04 15:17:31 · 674 阅读 · 0 评论 -
[leetcode 287]Find the Duplicate Number
Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate element must exist. Assume that there is only one duplicate number,原创 2015-09-28 13:51:35 · 2220 阅读 · 0 评论 -
[leetcode 289]Game of Life
According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."Given a board with m原创 2015-10-07 13:52:54 · 2944 阅读 · 0 评论 -
[leetcode 290]Word Pattern
Given a pattern and a string str, find if str follows the same pattern.Examples:pattern = "abba", str = "dog cat cat dog" should return true.pattern = "abba", str = "dog cat cat fish"原创 2015-10-07 14:13:27 · 673 阅读 · 0 评论 -
[leetcode 463]Island Perimeter
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is completely原创 2016-12-07 11:42:08 · 498 阅读 · 0 评论 -
[leetcode 452]Minimum Number of Arrows to Burst Balloons
There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordin原创 2016-11-23 14:15:57 · 586 阅读 · 0 评论 -
[leetcode 464]Can I Win
In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach or exceed 100 wins.What if we change the game s原创 2016-11-29 11:39:29 · 1386 阅读 · 0 评论 -
[leetcode 440]K-th Smallest in Lexicographical Order
Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.Note: 1 ≤ k ≤ n ≤ 109.Example:Input:n: 13 k: 2Output:10Explanation:The lexicograp原创 2016-11-10 21:46:50 · 1190 阅读 · 0 评论 -
[leetcode 441]Arranging Coins
ou have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.Given n, find the total number of full staircase rows that can be formed.n原创 2016-11-10 18:05:29 · 478 阅读 · 0 评论 -
[leetcode 453]Minimum Moves to Equal Array Elements
Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.Example:Input:[1,2,3]原创 2016-11-10 17:47:58 · 422 阅读 · 0 评论 -
[leetcode 283]Move Zeroes
Given 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 calling you原创 2015-09-21 14:05:47 · 558 阅读 · 0 评论 -
[leetcode 282]Expression Add Operators
Given a string that contains only digits 0-9 and a target value, return all possibilities to add binary operators (not unary) +, -, or * between the digits so they evaluate to the target value.原创 2015-09-21 11:26:42 · 1742 阅读 · 0 评论 -
[leetcode 278]First Bad Version
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the原创 2015-09-08 22:05:24 · 728 阅读 · 0 评论 -
[leetcode 70]Climbing Stairs
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 climb to the top?爬台阶,你每次可以上一层或者两层,问上n层你共有多少何种原创 2015-08-01 19:11:01 · 924 阅读 · 0 评论 -
[leetcode 235]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 betw原创 2015-08-08 17:32:51 · 476 阅读 · 0 评论 -
[leetcode 72]Edit Distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a wor原创 2015-07-31 10:24:28 · 497 阅读 · 0 评论 -
[leetcode 221]Maximal Square
Maximal SquareTotal Accepted: 8699 Total Submissions: 44034Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example,原创 2015-08-03 15:42:13 · 556 阅读 · 0 评论 -
[leetcode 139]Word Break
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"原创 2015-08-04 16:52:43 · 685 阅读 · 0 评论 -
[leetcode 213]House Robber II
Note: This is an extension of House Robber.After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time原创 2015-08-05 15:35:12 · 591 阅读 · 0 评论 -
[leetcode 237]Delete Node in a Linked List
Write 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 given the third node with val原创 2015-08-09 08:31:02 · 591 阅读 · 0 评论 -
[leetcode 268]Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.Note:Your algorithm shoul原创 2015-08-31 09:52:38 · 602 阅读 · 0 评论 -
[leetcode 239]Sliding Window Maximum
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window原创 2015-08-07 16:09:27 · 733 阅读 · 0 评论 -
[leetcode 257]Binary Tree Paths
Given a binary tree, return all root-to-leaf paths.For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are:["1->2->5", "1->3"]深度优先遍历,返回原创 2015-09-01 14:24:16 · 909 阅读 · 0 评论 -
[leetcode 222]Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely fille原创 2015-09-02 11:20:12 · 484 阅读 · 0 评论 -
[leetcode 238]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 and in O原创 2015-08-07 17:35:20 · 565 阅读 · 0 评论 -
[leetcode 32]Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()",原创 2015-08-01 08:38:43 · 694 阅读 · 0 评论 -
[leetcode 273]Integer to English Words
Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.For example,123 -> "One Hundred Twenty Three"12345 -> "Twelve Thousand原创 2015-09-02 10:15:14 · 641 阅读 · 0 评论 -
[leetcode 96]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. 1 3 3 2 1原创 2015-08-02 18:16:40 · 648 阅读 · 0 评论 -
[leetcode 234]Implement Queue using Stacks
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 queue.peek() -- Get the front element.empty(原创 2015-08-08 20:18:37 · 634 阅读 · 0 评论 -
[leetcode 263 264]Ugly Number I II
Write a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly si原创 2015-08-31 11:19:56 · 993 阅读 · 1 评论 -
[leetcode 242]Valid Anagram
Given 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.Note:You may a原创 2015-08-05 20:18:29 · 1143 阅读 · 0 评论 -
[leetcode 236]Lowest Common Ancestor of a Binary Tree
Given 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 ancestor is defined between two node原创 2015-08-08 17:16:07 · 631 阅读 · 0 评论