LeetCode
PKU_CXK
北京大学信息科学技术学院
展开
-
LeetCode | 38. Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211 is read off as “one 1” or 11. 11 is read off as “t原创 2017-06-10 18:33:49 · 262 阅读 · 0 评论 -
LeetCode | 61. Rotate List
Given a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1->2->3->4->5->NULL and k = 2,return 4->5->1->2->3->NULL.题意:将链表的右端的K个元素放到左边。// 16 ms/** * Definitio原创 2017-07-07 10:58:09 · 337 阅读 · 0 评论 -
LeetCode | 43. Multiply Strings(大整数乘法)
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2.Note:The length of both num1 and num2 is < 110.Both num1 and num2 contains only digits 0-9.Bo原创 2017-06-26 01:09:01 · 457 阅读 · 0 评论 -
LeetCode | 62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the botto原创 2017-07-17 16:11:24 · 276 阅读 · 0 评论 -
LeetCode | 68. 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 is, pa原创 2017-07-31 00:21:19 · 334 阅读 · 0 评论 -
LeetCode | 64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any原创 2017-07-21 20:42:41 · 296 阅读 · 0 评论 -
LeetCode | 73. Set Matrix Zeroes
DescriptionGiven a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Solution代码1:空间O(m + n),62 ms AC 将矩阵的0的状态存储在行列两个数组中class Solution {public: void setZeroes(vec原创 2017-08-08 09:56:15 · 554 阅读 · 0 评论 -
LeetCode | 65. Valid Number
Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous. You should g原创 2017-07-25 09:57:10 · 427 阅读 · 0 评论 -
LeetCode | 66. Plus One
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.You may assume the integer do not contain any leading zero, except the number 0 itself.The digits are st原创 2017-07-25 10:07:38 · 268 阅读 · 0 评论 -
LeetCode | 60. Permutation Sequence——第K个全排列
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""312""321"原创 2017-07-06 22:50:42 · 524 阅读 · 0 评论 -
LeetCode | 46. Permutations
Given 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], [3,2,1]]题意:给出几原创 2017-06-28 09:16:45 · 318 阅读 · 0 评论 -
LeetCode | 55. Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you are原创 2017-07-02 16:53:27 · 254 阅读 · 0 评论 -
LeetCode | 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].思路:按照start排序,然后遍历全部元素,如果完全错开就放进去,如果没有完全错开就修改上一区间的end值。用vector原创 2017-07-02 17:24:20 · 437 阅读 · 0 评论 -
LeetCode | 57. Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Example 1:原创 2017-07-03 17:16:59 · 336 阅读 · 0 评论 -
LeetCode | 58. Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string.If the last word does not exist, return 0.Note: A word is defined as原创 2017-07-03 17:27:11 · 274 阅读 · 0 评论 -
LeetCode | 39. Combination Sum
Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C原创 2017-06-13 02:41:52 · 270 阅读 · 0 评论 -
LeetCode | 59. Spiral Matrix II
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example, Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5原创 2017-07-04 16:58:14 · 346 阅读 · 0 评论 -
LeetCode | 45. Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is to reac原创 2017-06-26 23:28:26 · 312 阅读 · 0 评论 -
LeetCode | 40. Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.Each number in C may only be used once in the combination.No原创 2017-06-15 17:08:34 · 311 阅读 · 0 评论 -
LeetCode | 67. Add Binary
Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".思路:大整数加法,二进制class Solution {public: string addBinary(string a, string b) { int原创 2017-07-25 10:25:09 · 290 阅读 · 0 评论 -
LeetCode | 69. Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.很简单的题:class Solution {public: int mySqrt(int x) { return int(sqrt(x)); }};原创 2017-08-03 00:48:25 · 311 阅读 · 0 评论 -
LeetCode | 70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a positive inte原创 2017-08-03 00:56:09 · 337 阅读 · 0 评论 -
LeetCode | 88. Merge Sorted Array
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional原创 2017-10-16 19:01:53 · 995 阅读 · 0 评论 -
Leetcode 79. Word Search
https://leetcode.com/problems/word-search/description/exampleboard =[ ['A','B','C','E'], ['S','F','C','S'], ['A','D','E','E']]Given word = "ABCCED", return true.Given word = "SEE", retu...原创 2018-09-07 16:49:54 · 315 阅读 · 0 评论 -
LeetCode 84. Largest Rectangle in Histogram
https://leetcode.com/problems/largest-rectangle-in-histogram/DescriptionGiven n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of large...原创 2019-02-15 01:41:51 · 220 阅读 · 0 评论 -
LeetCode 85. Maximal Rectangle
https://leetcode.com/problems/maximal-rectangle/DescriptionGiven a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.Example:Input:[ [...原创 2019-02-15 18:54:53 · 239 阅读 · 0 评论 -
LeetCode 96. Unique Binary Search Trees
https://leetcode.com/problems/unique-binary-search-trees/DescriptionGiven n, how many structurally unique BST’s (binary search trees) that store values 1 … n?Example:Input: 3Output: 5Explanatio...原创 2019-02-16 16:59:16 · 206 阅读 · 0 评论 -
LeetCode 97. Interleaving String
https://leetcode.com/problems/interleaving-string/DescriptionGiven s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.Example 1:Input: s1 = "aabcc", s2 = "dbbca", s3 = "aadbbc...原创 2019-02-16 17:45:49 · 216 阅读 · 0 评论 -
LeetCode 101. Symmetric Tree
https://leetcode.com/problems/symmetric-tree/DescriptionGiven a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] i...原创 2019-02-18 02:42:53 · 310 阅读 · 0 评论 -
LeetCode 87. Scramble String
https://leetcode.com/problems/scramble-string/DescriptionGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible rep...原创 2019-02-13 15:14:37 · 180 阅读 · 0 评论 -
LeetCode | 89. Gray Code
The 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 of gray原创 2017-09-30 10:10:20 · 373 阅读 · 0 评论 -
LeetCode | 80. Remove Duplicates from Sorted Array II
Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five element原创 2017-09-16 22:03:32 · 317 阅读 · 0 评论 -
LeetCode | 71. Simplify Path
Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"Corner Cases:Did you consider the case where path = "/../"?In thi原创 2017-08-03 01:39:33 · 358 阅读 · 0 评论 -
LeetCode | 74. Search a 2D Matrix
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 to right. The first integer of each row is原创 2017-08-10 21:49:14 · 346 阅读 · 0 评论 -
LeetCode | 75. Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0, 1,原创 2017-08-20 20:51:00 · 296 阅读 · 0 评论 -
LeetCode | 72. Edit Distance
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 operations permitted on a word:a) In原创 2017-08-06 17:29:21 · 285 阅读 · 0 评论 -
LeetCode | 76. Minimum Window Substring
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BANC".Note: If原创 2017-09-05 13:35:33 · 271 阅读 · 0 评论 -
LeetCode | 77. Combinations
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], [1,2], [1,3], [1,4],]Solution递归原创 2017-09-06 11:42:08 · 296 阅读 · 0 评论 -
LeetCode | 81. Search in Rotated Sorted Array II
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).Write a function to determine if a given target is in the原创 2017-09-22 17:49:54 · 361 阅读 · 0 评论 -
LeetCode | 78. Subsets
Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3], [1], [2], [1,2原创 2017-09-07 10:58:02 · 348 阅读 · 0 评论