LeetCode
文章平均质量分 96
DouMiaoO_Oo
这个作者很懒,什么都没留下…
展开
-
LeetCode|Maximum Product Subarray
Maximum Product SubarrayGiven an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.Example 1:Input: [2,3,-2,4]Output: ...原创 2019-04-01 13:33:36 · 168 阅读 · 0 评论 -
LeetCode|Permutations*
PermutationsGiven a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1原创 2019-03-05 22:15:38 · 157 阅读 · 0 评论 -
LeetCode|Subsets
Subsets Given a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.For原创 2019-02-24 00:19:06 · 202 阅读 · 0 评论 -
LeetCode|Gray Code
Gray CodeThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence原创 2016-04-30 19:45:22 · 2266 阅读 · 0 评论 -
LeetCode|Summary Ranges
Summary RangesGiven 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”].注意:有INT_MAX和INT_MIN,减法小心溢出,还有-INT_MIN原创 2016-06-10 09:20:11 · 549 阅读 · 0 评论 -
LeetCode|Path Sum*
Path SumGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: Given the below binary tree and原创 2016-05-21 23:07:24 · 492 阅读 · 0 评论 -
LeetCode|Binary Tree Right Side View
Binary Tree Right Side ViewGiven a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: Given the followin原创 2016-05-21 20:00:07 · 353 阅读 · 0 评论 -
LeetCode|Add and Search Word - Data structure design
Add and Search Word - Data structure designDesign a data structure that supports the following two operations:void addWord(word)bool search(word)search(word) can search a literal word or a regular ex原创 2016-05-21 18:59:01 · 421 阅读 · 0 评论 -
LeetCode|Surrounded Regions
Surrounded RegionsGiven 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原创 2016-05-21 15:33:41 · 395 阅读 · 0 评论 -
LeetCode|Implement Trie (Prefix Tree)
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: // Initi原创 2016-05-21 12:56:07 · 427 阅读 · 0 评论 -
LeetCode|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 assume原创 2016-05-21 11:40:33 · 354 阅读 · 0 评论 -
LeetCode|Search a 2D Matrix*
Search a 2D MatrixWrite 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 from left to right.The first inte原创 2016-05-20 23:34:44 · 442 阅读 · 0 评论 -
双指针法题目总结
Move ZeroesGiven 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原创 2016-04-23 17:48:12 · 726 阅读 · 0 评论 -
LeetCode|Reverse Words in a String
Reverse Words in a StringGiven 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 solv原创 2016-05-05 08:09:12 · 419 阅读 · 0 评论 -
LeetCode|Perfect Squares
Perfect SquaresGiven 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原创 2016-05-18 20:19:45 · 381 阅读 · 0 评论 -
二叉树题目总结
Invert Binary TreeInvert a binary tree.Recursion:class Solution {public: TreeNode* invertTree(TreeNode* root) { if(root == NULL) return NULL; swap(root->left, root->right);原创 2016-04-21 23:07:40 · 1390 阅读 · 0 评论 -
LeetCode|Contains Duplicate*
Contains DuplicateGiven 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原创 2016-05-14 10:38:41 · 611 阅读 · 0 评论 -
LeetCode|Find Median from Data Stream
Find Median from Data Stream《剑指offer》上面也有详细的解答class MedianFinder {public: /** initialize your data structure here. */ MedianFinder() { max_s = priority_queue<int, vector<int&g...原创 2019-03-05 22:38:52 · 176 阅读 · 0 评论 -
LeetCode|Pow(x, n)
Pow(x, n)Implement pow(x, n), which calculates x raised to the power n (xn).Example 1:Input: 2.00000, 10Output: 1024.00000Example 2:Input: 2.10000, 3Output: 9.26100Example 3:Input: 2.00000,...原创 2019-03-08 19:52:06 · 276 阅读 · 0 评论 -
LeetCode|Rotate String
Rotate StringWe are given two strings, A and B.A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, if A = ‘abcde’, then it will be ‘bcd...原创 2019-03-08 20:13:22 · 148 阅读 · 0 评论 -
连续子数组的最大和 (Maximum Subarray)
Maximum Subarray 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 contiguous subar原创 2019-04-01 12:31:30 · 240 阅读 · 0 评论 -
LeetCode|Word Ladder*
Word LadderWord LadderGiven two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter...原创 2019-04-01 11:27:28 · 212 阅读 · 0 评论 -
LeetCode|Super Pow
Super PowSuper PowYour task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Example 1:Input: a = 2, b = [3]Out...原创 2019-03-31 17:23:04 · 168 阅读 · 0 评论 -
最长上升子序列 ( Longest Increasing Subsequence)
Longest Increasing SubsequenceGiven an unsorted array of integers, find the length of longest increasing subsequence.Example:Input: [10,9,2,5,3,7,101,18]Output: 4 Explanation: The longest increas...原创 2019-03-31 12:11:11 · 228 阅读 · 0 评论 -
LeetCode|Clone Graph
Clone GraphGiven a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node in the graph contains a val (int) and a list (List[Node]) of its neighbors....原创 2019-03-23 23:59:07 · 239 阅读 · 0 评论 -
LeetCode|Rotate Image
Rotate ImageYou 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 2...原创 2019-03-31 00:43:39 · 200 阅读 · 0 评论 -
LeetCode|Copy List with Random Pointer
Copy List with Random PointerA linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Note:You must return the copy of the ...原创 2019-03-30 22:06:13 · 163 阅读 · 0 评论 -
LeetCode|Course Schedule *
Course ScheduleCourse Schedule拓扑排序class Solution {public: bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) { if(numCourses == 0) return true; ...原创 2019-03-30 14:23:45 · 370 阅读 · 0 评论 -
LeetCode|Second Minimum Node In a Binary Tree
Second Minimum Node In a Binary TreeSecond Minimum Node In a Binary TreeGiven a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactl...原创 2019-03-23 00:33:13 · 209 阅读 · 0 评论 -
LeetCode|Accounts Merge
Accounts MergeGiven a list accounts, each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails representing emails of th...原创 2019-03-18 10:37:55 · 184 阅读 · 0 评论 -
LeetCode|Redundant Connection
In this problem, a tree is an undirected graph that is connected and has no cycles.The given input is a graph that started as a tree with N nodes (with distinct values 1, 2, …, N), with one additiona...原创 2019-03-18 08:39:38 · 135 阅读 · 0 评论 -
LeetCode|Friend Circles
Friend CirclesThere are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct fri...原创 2019-03-18 00:31:01 · 134 阅读 · 0 评论 -
LeetCode|Rotated Digits
Rotated DigitsX is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. Each digit must be rotated - we cannot choose to leave it a...原创 2019-03-08 22:46:55 · 132 阅读 · 0 评论 -
LeetCode|Group Anagrams
Group AnagramsGiven an array of strings, group anagrams together.Example:Input: ["eat", "tea", "tan", "ate", "nat", "bat"],Output:[ ["ate","eat","tea"], [&qu原创 2019-03-08 22:29:16 · 139 阅读 · 0 评论 -
LeetCode|Regular Expression Matching
Binary Tree Zigzag Level Order TraversalGiven a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate...原创 2019-03-08 22:15:10 · 160 阅读 · 0 评论 -
LeetCode|Rotting Oranges
Rotting Oranges题目不难,但是写了好久…class Solution {public: int orangesRotting(vector<vector<int>>& grid) { int fresh_cnt = 0; int t = 0; int m = grid.size(), n =...原创 2019-03-08 21:23:52 · 206 阅读 · 0 评论 -
LeetCode|Longest Substring Without Repeating Characters
Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3原创 2016-05-17 19:43:42 · 430 阅读 · 0 评论 -
二分法汇总
二分法汇总原创 2019-03-26 00:29:26 · 1453 阅读 · 0 评论 -
LeetCode|Implement Stack using Queues
Implement Stack using QueuesImplement 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原创 2016-04-21 08:48:52 · 333 阅读 · 0 评论 -
LeetCode|Convert * to Binary Search Tree
Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.思路:递归找中点做rootclass Solution {public: TreeNode* sortedArra原创 2016-04-30 11:08:47 · 393 阅读 · 0 评论