随笔分类 - LeetCode
摘要：Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicat
阅读全文
摘要：Given two integers n and k, return all possible combinations of k numbers chosen from the range [1, n]. You may return the answer in any order. Exampl
阅读全文
摘要：Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequent
阅读全文
摘要：Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The r
阅读全文
摘要：Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relati
阅读全文
摘要：There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values). Before being passed to your function, nums is ro
阅读全文
摘要：There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at a
阅读全文
摘要：Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight). For example, the 32-bit
阅读全文
摘要：You are given an m x n integer matrix matrix with the following two properties: Each row is sorted in non-decreasing order. The first integer of each
阅读全文
摘要：Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example 1: Input: matri
阅读全文
摘要：Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle
阅读全文
摘要：Reverse bits of a given 32 bits unsigned integer. Example 1: Input: 00000010100101000001111010011100 Output: 00111001011110000010100101000000 Explanat
阅读全文
摘要：Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should p
阅读全文
摘要：We can scramble a string s to get a string t using the following algorithm: If the length of the string is 1, stop. If the length of the string is > 1
阅读全文
摘要：An n-bit gray code sequence is a sequence of 2n integers where: Every integer is in the inclusive range [0, 2n - 1], The first integer is 0, An intege
阅读全文
摘要：A message containing letters from A-Z is being encoded to numbers using the following mapping: Given a non-empty string containing only digits, determ
阅读全文
摘要：Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a subset must be in non-descending ord
阅读全文
摘要：Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Retu
阅读全文
摘要：Reverse a linked list from position m to n. Do it in one-pass. Note: 1 ≤ m ≤ n ≤ length of list. Example: Input: 1->2->3->4->5->NULL, m = 2, n = 4 Out
阅读全文
摘要：Given a string containing only digits, restore it by returning all possible valid IP address combinations. Example: Input: "25525511135" Output: ["255
阅读全文
