练习题
文章平均质量分 64
uita
这个作者很懒,什么都没留下…
展开
-
Remove Nth Node From End of List(leetcode)
Remove Nth Node From End of List(leetcode)Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. Afte原创 2018-01-06 11:58:44 · 219 阅读 · 0 评论 -
Word Search(leetcode)
Word Search(leetcode)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 hor原创 2018-01-06 12:01:16 · 315 阅读 · 0 评论 -
Unique Binary Search Trees II(leetocde)
Unique Binary Search Trees II(leetocde)Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should原创 2018-01-06 12:07:36 · 233 阅读 · 0 评论 -
Permutation Sequence(leetcode)
Permutation Sequence(leetcode)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 =原创 2018-01-06 12:03:21 · 205 阅读 · 0 评论 -
Regular Expression Matching(leetcode)
Regular Expression Matching(leetcode)Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.Th原创 2018-01-06 12:16:07 · 232 阅读 · 0 评论 -
Combinations(leetcode)
Combinations(leetcode)Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3],原创 2018-01-07 09:44:10 · 334 阅读 · 0 评论 -
Search a 2D Matrix(leetcode)
Search a 2D Matrix(leetcode)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 from left原创 2018-01-07 09:47:35 · 257 阅读 · 0 评论 -
Permutations II(leetcode)
Permutations II(leetcode)Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [原创 2018-01-06 11:55:30 · 272 阅读 · 0 评论 -
Group Anagrams(leetcode)
Group Anagrams(leetcode)Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"],原创 2018-01-06 11:51:58 · 229 阅读 · 0 评论 -
Longest Valid Parentheses(leetcode)
Longest Valid Parentheses(Leetcode)Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest va原创 2018-01-06 11:09:50 · 243 阅读 · 0 评论 -
Freedom Trail(leetcode)
Freedom TrailIn the video game Fallout 4, the quest "Road to Freedom" requires players to reach a metal dial called the "Freedom Trail Ring", and use the dial to spell a specific keyword in order原创 2017-09-23 16:20:12 · 556 阅读 · 0 评论 -
Strange Printer (leetcode)
There is a strange printer with the following two special requirements:The printer can only print a sequence of the same character each time.At each turn, the printer can print new characters star原创 2017-09-07 14:30:02 · 388 阅读 · 0 评论 -
Predict the Winner(leetcode)
Predict the WinnerGiven an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Ea原创 2017-10-20 08:10:27 · 240 阅读 · 0 评论 -
Binary Tree Level Order Traversal(leetcode)
Binary Tree Level Order Traversal(leetcode)Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree原创 2017-12-31 13:25:39 · 288 阅读 · 0 评论 -
Distinct Subsequences(Leetcode)
Distinct SubsequencesGiven a string S and a string T, count the number of distinct subsequences of S which equals T.A subsequence of a string is a new string which is formed from the original原创 2018-01-03 15:14:11 · 400 阅读 · 0 评论 -
Best Time to Buy and Sell Stock III(Leetcode)
Best Time to Buy and Sell Stock III(Leetcode)Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may comp原创 2018-01-05 10:22:19 · 236 阅读 · 0 评论 -
First Missing Positive(leetcode)
First Missing Positive(leetcode)Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should ru原创 2018-01-06 11:47:08 · 235 阅读 · 0 评论 -
Edit Distance
Edit Distance(leetcode)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 oper原创 2018-01-07 11:02:51 · 224 阅读 · 0 评论