fast
文章平均质量分 58
poiop221
这个作者很懒,什么都没留下…
展开
-
Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"click to show corner cases.Corner Cases:Did转载 2015-09-24 10:05:04 · 254 阅读 · 0 评论 -
Permutation Sequence (略)
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""3转载 2015-09-20 00:01:32 · 211 阅读 · 0 评论 -
course shedule(略)
There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as转载 2015-09-20 05:33:01 · 264 阅读 · 0 评论 -
Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s,find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.题目是找到>=s的最小子数组长度For example, given转载 2015-09-19 22:25:13 · 228 阅读 · 0 评论 -
Group Anagram
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note:转载 2015-09-19 21:32:57 · 283 阅读 · 0 评论 -
clone graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for each原创 2015-09-18 22:43:12 · 295 阅读 · 0 评论 -
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-17 23:19:57 · 195 阅读 · 0 评论 -
Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given原创 2015-09-16 22:25:03 · 218 阅读 · 0 评论 -
H index II
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?二分:public int hIndex(int[] citations) { int len = citations.length;原创 2015-09-18 07:50:08 · 258 阅读 · 0 评论 -
Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.public class Solution { /** * e.g x =27 * 16 h = 2 最高位 100 * b = 2-1 = 1 ==> 1 10 | 100 = 110 * 110*110 = 6*6原创 2015-09-18 08:25:46 · 244 阅读 · 0 评论 -
Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.public int singleNumber(int[] A) { if (A == null || A.length == 0) return 0; int[] a = new原创 2015-09-17 03:30:45 · 171 阅读 · 0 评论 -
H-Index
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: "A原创 2015-09-18 05:56:17 · 248 阅读 · 0 评论 -
Rotate Array
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].Note:Try to come up as many solutions as yo原创 2015-09-16 07:59:03 · 167 阅读 · 0 评论 -
Restore IP Addresses(DFS的巅峰)
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given "25525511135",return ["255.255.11.135", "255.255.111.35"]. (Order转载 2015-09-22 10:07:04 · 196 阅读 · 0 评论 -
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 21:21:17 · 293 阅读 · 0 评论 -
Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node's key.Th原创 2015-09-24 09:35:07 · 191 阅读 · 0 评论 -
Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest转载 2015-09-24 11:00:25 · 206 阅读 · 0 评论 -
Number of Digit One(数学找规律)
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example:Given n = 13,Return 6, because digit 1 occurred in the follow转载 2015-09-23 03:29:31 · 234 阅读 · 0 评论 -
Ugly Number II
Write 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 sequence of the first转载 2015-09-23 03:12:17 · 182 阅读 · 0 评论 -
Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically原创 2015-09-23 01:34:01 · 193 阅读 · 0 评论 -
Maximal Square
Given 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, given the following matrix:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0转载 2015-09-23 05:04:44 · 177 阅读 · 0 评论 -
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-22 10:20:25 · 177 阅读 · 0 评论 -
Multiply Strings
Given two numbers represented as strings, return multiplication of the numbers as a string.public class Solution { public String multiply(String num1, String num2) { if (num1 == null ||转载 2015-09-22 10:43:40 · 185 阅读 · 0 评论 -
Repeated DNA Sequences
All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.Wri转载 2015-09-23 02:19:15 · 193 阅读 · 0 评论 -
Peeking Iterator
Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation -- it essentially peek() at the element that will be转载 2015-09-21 22:20:42 · 309 阅读 · 0 评论 -
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.import java.util.*;public class Solution { p原创 2015-09-21 21:11:59 · 224 阅读 · 0 评论 -
Evaluate Reverse Polish Notation
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1",转载 2015-09-22 02:54:53 · 198 阅读 · 0 评论 -
Compare Version Numbers
Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 version2 return -1, otherwise return 0.You may assume that the version strings are non-empty and co原创 2015-09-16 18:55:28 · 233 阅读 · 0 评论 -
Min stack
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get原创 2015-09-16 07:44:47 · 206 阅读 · 0 评论 -
Summary ranges
Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].public List summaryRanges(int[] nums) { L原创 2015-09-16 07:42:07 · 235 阅读 · 0 评论 -
Implement Trie (Prefix Tree)
Implement a trie with insert, search, and startsWith methods.Note:You may assume that all inputs are consist of lowercase letters a-z.class TrieNode { public char val; public boole原创 2015-09-13 03:50:13 · 281 阅读 · 0 评论 -
Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line./* * A line is determined by two factors,say y=ax+b * * If two points(x1,y1) (x2,转载 2015-09-27 23:44:03 · 310 阅读 · 0 评论 -
Valid Number
public class Solution { public boolean isNumber(String s) { s = s.trim(); boolean pointSeen = false; boolean eSeen = false; boolean numberSeen = false; boolean numberAfterE =原创 2015-09-27 21:25:30 · 306 阅读 · 0 评论 -
Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3转载 2015-09-27 11:38:48 · 222 阅读 · 0 评论 -
Divide Two Integers
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.class Solution {public: int divide(int dividend, int divisor) { if (!转载 2015-09-27 03:45:02 · 200 阅读 · 0 评论 -
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 Th转载 2015-09-27 03:23:39 · 219 阅读 · 0 评论 -
Word Ladder II(BFS + DFS)
Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a timeEac转载 2015-09-28 02:55:17 · 290 阅读 · 0 评论 -
Surrounded Regions
Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,X X X XX O O X转载 2015-09-27 10:44:49 · 252 阅读 · 0 评论 -
Fraction to Recurring Decimal
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.If the fractional part is repeating, enclose the repeating part in parentheses.转载 2015-09-27 11:14:09 · 246 阅读 · 0 评论 -
Text Justification
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.You should pack your words in a greedy approach; that i转载 2015-09-28 03:23:59 · 215 阅读 · 0 评论