Medium
文章平均质量分 77
BigFatSheep
这个作者很懒,什么都没留下…
展开
-
151. Reverse Words in a String
问题描述Given an input string, reverse the string word by word.For example, Given s = "the sky is blue", return "blue is sky the".Update (2015-02-12): For C programmers: Try to solve it in-place in O(1)原创 2018-03-16 13:45:50 · 179 阅读 · 0 评论 -
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: The solution set must not contain du原创 2018-03-19 05:38:58 · 114 阅读 · 0 评论 -
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 legibility) P A H N A P L原创 2018-03-13 08:19:07 · 117 阅读 · 0 评论 -
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 digit. Add the two numbers and retur原创 2018-03-12 11:12:49 · 113 阅读 · 0 评论 -
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 of line i is at (i, ai) and (i, 0). Find two原创 2018-03-13 08:57:09 · 103 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters
问题描述Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with th原创 2018-03-13 09:55:57 · 109 阅读 · 0 评论 -
12. Integer to Roman
问题描述Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.题目链接:思路分析给一个1-3999的整数,将其转化为罗马数字的字符串。用一个极为丑陋的方式解决,将满足不同的条件的if语句放入循环中,每次减去相应的数值,直到num变为0;代码cl原创 2018-03-14 05:33:09 · 164 阅读 · 0 评论 -
388. Longest Absolute File Path
问题描述Suppose we abstract our file system by a string in the following manner:The string "dir\n\tsubdir1\n\tsubdir2\n\t\tfile.ext" represents:dir subdir1 subdir2 file.extThe directory di原创 2018-03-30 06:38:50 · 132 阅读 · 0 评论 -
200. Number of Islands
问题描述Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may ...原创 2018-04-08 09:37:18 · 97 阅读 · 0 评论 -
17. Letter Combinations of a Phone Number
问题描述Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below. **Input:**Digit st原创 2018-03-31 08:00:59 · 113 阅读 · 0 评论 -
49. Group Anagrams
问题描述Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return: [ [“ate”, “eat”,”tea”], [“nat”,”tan”], [“bat原创 2018-04-08 15:01:56 · 100 阅读 · 0 评论 -
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(n).原创 2018-04-01 02:49:06 · 96 阅读 · 0 评论 -
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 an array.Example: For num =...原创 2018-04-09 03:26:01 · 102 阅读 · 0 评论 -
139. Word Break
问题描述Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You ma...原创 2018-04-09 06:49:45 · 167 阅读 · 0 评论 -
152. 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 larg...原创 2018-04-09 07:28:06 · 126 阅读 · 0 评论 -
8. String to Integer (atoi)
问题描述Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible inpu...原创 2018-04-09 09:36:49 · 109 阅读 · 0 评论 -
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: [ “((()))”, “(()())”, “((...原创 2018-04-01 14:38:59 · 168 阅读 · 0 评论 -
328. Odd Even Linked List
问题描述Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do i...原创 2018-04-10 03:33:34 · 157 阅读 · 0 评论 -
48. Rotate Image
问题描述You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note: You have to rotate the image in-place, which means you have to modify the input 2D ma...原创 2018-04-10 14:01:59 · 131 阅读 · 0 评论 -
46. Permutations
问题描述Given a collection of distinct integers, return all possible permutations.Example: Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1原创 2018-04-16 12:40:23 · 145 阅读 · 0 评论 -
147. Insertion Sort List
问题描述Sort a linked list using insertion sort.题目链接:思路分析用插入排序对一个链表进行排序。插入排序就是对于新的元素,将它插入到已排序的元素的合适位置。如果是在数组中,还需要移动元素,但是对于链表就没有这个必要了,所以非常适合链表。我们设置一个新的头new_head,cur = head表示之前的结点已经排序,和一个寻找合适位...原创 2018-04-16 14:09:32 · 138 阅读 · 0 评论 -
153. Find Minimum in Rotated Sorted Array
问题描述Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no du...原创 2018-04-11 02:34:52 · 123 阅读 · 0 评论 -
33. Search in Rotated Sorted Array
问题描述Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If foun...原创 2018-04-11 03:01:33 · 123 阅读 · 0 评论 -
319. Bulb Switcher
问题描述There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turnin...原创 2018-04-11 09:57:10 · 130 阅读 · 0 评论 -
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 the following rules: You receive a vali...原创 2018-04-11 10:21:53 · 123 阅读 · 0 评论 -
50. Pow(x, n)
问题描述Implement pow(x, n).Example 1: Input: 2.00000, 10 Output: 1024.00000Example 2: Input: 2.10000, 3 Output: 9.26100题目链接:思路分析实现一个数的n次方。递归的思路,因为用常规的连乘会TLE,所以每次将n减少为原来的一半...原创 2018-04-04 05:26:24 · 96 阅读 · 0 评论 -
150. 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”, “...原创 2018-04-11 15:15:41 · 175 阅读 · 0 评论 -
173. Binary Search Tree Iterator
问题描述Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number in the BST.Note: next...原创 2018-04-17 01:57:50 · 125 阅读 · 0 评论 -
16. 3Sum Closest
问题描述Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input ...原创 2018-04-17 02:18:33 · 128 阅读 · 0 评论 -
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. 题目链接:思路分析给一数n,计算n个数可以生成多少个不同的二叉...原创 2018-04-17 02:55:05 · 135 阅读 · 0 评论 -
384. Shuffle an Array
问题描述Shuffle a set of numbers without duplicates.Example: // Init an array with set 1, 2, and 3. int[] nums = {1,2,3}; Solution solution = new Solution(nums); // Shuffle the array [1...原创 2018-04-17 03:24:58 · 137 阅读 · 0 评论 -
29. Divide Two Integers
问题描述Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.Return the quotient after dividing dividend by divisor.Example 1: Inp...原创 2018-04-17 05:17:28 · 197 阅读 · 0 评论 -
179. Largest Number
问题描述Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.Note: The result may be ...原创 2018-04-17 13:01:51 · 177 阅读 · 0 评论 -
54. Spiral Matrix
问题描述Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.Example 1: Input: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] Out...原创 2018-04-17 14:44:35 · 155 阅读 · 0 评论 -
137. Single Number II
问题描述Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one.Note: Your algorithm should have a linear runtime complexity. Co...原创 2018-04-05 14:00:39 · 97 阅读 · 0 评论 -
56. Merge Intervals
问题描述Given a collection of intervals, merge all overlapping intervals.For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18].题目链接:思路分析给出一系列的时间间隔,由自定义的struct,包含了开始时间sta...原创 2018-04-05 15:03:02 · 90 阅读 · 0 评论 -
433. Minimum Genetic Mutation
问题描述A gene string can be represented by an 8-character long string, with choices from "A", "C", "G", "T".Suppose we need to investigate about a mutation (mutation from “start” to “end”), where ONE muta原创 2018-04-22 06:08:29 · 280 阅读 · 0 评论 -
406. Queue Reconstruction by Height
问题描述Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of th原创 2018-04-22 06:57:24 · 132 阅读 · 0 评论 -
228. Summary Ranges
问题描述Given a sorted integer array without duplicates, return the summary of its ranges.Example 1: Input: [0,1,2,4,5,7] Output: [“0->2”,”4->5”,”7”]Example 2: Input: [0,2,3,4,6,8,9] Output: [“0原创 2018-04-22 07:29:47 · 145 阅读 · 0 评论 -
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 absolute difference between nums[i] and nums[j] is at most t and the absolute differen原创 2018-04-23 03:53:15 · 142 阅读 · 0 评论