关注
分享
文章平均质量分 60
本专栏为Leetcode算法分析专栏，不会的算法要学，和博主一起刷Leetcode吧！
代码下载地址：https://github.com/hjptriplebee/Leetcode
triplebee
人狠话不多
展开
-
Leetcode 300. Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], ther原创 2017-04-20 09:32:52 · 1455 阅读 · 0 评论 -
Leetcode 299. Bulls and Cows
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint t原创 2017-04-19 17:12:42 · 1277 阅读 · 0 评论 -
Leetcode 297. Serialize and Deserialize Binary Tree
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be原创 2017-04-19 16:50:08 · 1112 阅读 · 0 评论 -
Leetcode 295. Find Median from Data Stream
Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.Examples: [2,3,4] , the median原创 2017-04-19 11:25:54 · 1266 阅读 · 0 评论 -
Leetcode 292. Nim Game
You 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 removes the last stone will be the原创 2017-04-18 17:47:08 · 1028 阅读 · 0 评论 -
Leetcode 290. Word Pattern
Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.原创 2017-04-18 17:33:21 · 1123 阅读 · 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原创 2017-04-18 11:35:26 · 1061 阅读 · 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 number must exist. Assume that there is only one duplicate number,原创 2017-04-17 20:18:41 · 1296 阅读 · 2 评论 -
Leetcode 284. 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 r原创 2017-04-17 17:49:27 · 1119 阅读 · 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原创 2017-04-17 17:31:41 · 1037 阅读 · 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.原创 2017-04-17 17:16:45 · 1095 阅读 · 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 =原创 2017-04-16 21:18:15 · 1114 阅读 · 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原创 2017-04-16 20:53:56 · 935 阅读 · 0 评论 -
Leetcode 275. H-Index II
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm?接上一篇，数组升序排列。一看就是二分，需要注意边界，仔细想想。class Solution {public: int hIndex(ve原创 2017-04-16 20:04:03 · 988 阅读 · 0 评论 -
Leetcode 274. 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原创 2017-04-16 19:02:56 · 991 阅读 · 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原创 2017-04-15 14:56:58 · 1016 阅读 · 0 评论 -
Leetcode 264. 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原创 2017-04-15 14:48:02 · 1064 阅读 · 0 评论 -
Leetcode 263. Ugly Number
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 sinc原创 2017-04-15 14:24:15 · 1028 阅读 · 0 评论 -
Leetcode 258. Add Digits
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. Since 2 has on原创 2017-04-15 14:03:37 · 908 阅读 · 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"]求二叉树所有从根到原创 2017-04-15 13:50:26 · 829 阅读 · 0 评论 -
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 ass原创 2017-04-15 13:31:49 · 848 阅读 · 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 1原创 2017-04-15 13:19:08 · 741 阅读 · 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原创 2017-04-14 16:45:36 · 1035 阅读 · 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原创 2017-04-13 20:37:48 · 1290 阅读 · 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原创 2017-04-13 19:10:31 · 867 阅读 · 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 value原创 2017-04-13 17:41:05 · 906 阅读 · 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原创 2017-04-06 10:30:50 · 1333 阅读 · 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 betwee原创 2017-04-06 10:19:46 · 1224 阅读 · 0 评论 -
Leetcode 234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?判断一个链表是否回文？要求O（n）时间复杂度，O（1）空间复杂度。快慢指针找到中点，将中点以后的逆置，再逐个判断是否相等/** * Definit原创 2017-04-06 09:38:46 · 1172 阅读 · 0 评论 -
Leetcode 233. 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 followin原创 2017-04-05 20:31:58 · 1119 阅读 · 0 评论 -
Leetcode 232. 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(原创 2017-04-05 19:34:33 · 1102 阅读 · 0 评论 -
Leetcode 231. Power of Two
Given an integer, write a function to determine if it is a power of two.判断一个数是不是2的若干次幂？第一个想法，首个bit位为1，其余全为0.优美解法：只有2的若干次幂和自身减1的每一个bit位不同，所以n &（n-1） ！= 0 说明这个数不是2的若干次幂。最后注意负数的情况。class Solut原创 2017-04-05 19:25:30 · 1194 阅读 · 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原创 2017-04-05 19:16:14 · 942 阅读 · 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.给一个数组，找出所有出现次数超过 n/3次的元素。要求线性时间复杂度，常数空间复杂度。原创 2017-04-05 15:58:04 · 1075 阅读 · 0 评论 -
Leetcode 228. 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"].给一个排序好的数组，将相邻的数字压缩成区间的表示。扫一遍，记录头尾，碰到后一个比前一个大超过1再处原创 2017-04-05 15:17:18 · 1098 阅读 · 0 评论 -
Leetcode 227. Basic Calculator II
Implement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative integers, +, -, *, / operators and empty spaces . The integer division should原创 2017-03-30 16:28:31 · 1152 阅读 · 0 评论 -
Leetcode 226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by Max Howe原创 2017-03-30 15:20:48 · 1129 阅读 · 0 评论 -
Leetcode 225. Implement Stack using Queues
Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet原创 2017-03-30 14:55:32 · 1050 阅读 · 0 评论 -
Leetcode 224. Basic Calculator
Implement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and em原创 2017-03-30 11:28:08 · 1511 阅读 · 0 评论 -
Leetcode 223. Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.Assume that the tota原创 2017-03-30 10:28:05 · 1176 阅读 · 0 评论