LeetCode算法编程
文章平均质量分 60
xiakexiaohu
阿里、快手、网易内推,需要私聊~
展开
-
LeetCode.763 Partition Labels(标签分类)
LeetCode 标签分割原创 2022-06-07 11:46:28 · 268 阅读 · 0 评论 -
全组合(SubSets)全排列(Permutation)全组合和(Combination Sum)解题技巧
1.1 全组合(无重复)题目:给定一个数组(不存在重复),输出所有可能的组合,不限定顺序(LeetCode 78)。样例:[1,2,3]=>[[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]技巧:因为是不存在重复的,典型的采用递归即可,即每次取定第一个开始的节点,然后从该节点后面开始放数据和出数据代码:class Solution { public List<List<Integer>> subsets(int[] num原创 2021-08-15 22:36:18 · 1969 阅读 · 1 评论 -
LeetCode.1861 Rotating the Box(旋转箱子)
1.题目You are given an m x n matrix of characters box representing a side-view of a box. Each cell of the box is one of the following:A stone ‘#’A stationary obstacle ‘*’Empty ‘.’The box is rotated 90 degrees clockwise, causing some of the stones to fal原创 2021-08-01 23:19:14 · 309 阅读 · 1 评论 -
LeetCode.791 Custom Sort String(自定义字符串排序)
1.题目You are given two strings order and s. All the words oforderareuniqueand were sorted in some custom order previously.Permute the characters ofsso that they match the order thatorderwas sorted. More specifically, if a characterxoccurs befo...原创 2021-07-24 22:26:39 · 198 阅读 · 0 评论 -
LeetCode.713 Subarray Product Less Than K(连续子数组乘积比k小的个数)
1.题目Given an array of integers nums and an integer k, return the number of contiguous subarrays where the product of all the elements in the subarray is strictly less than k. Example 1:Input: nums = [10,5,2,6], k = 100Output: 8Explanation: The 8原创 2021-07-20 12:58:11 · 199 阅读 · 0 评论 -
LeetCode.491 Increasing Subsequences(递增子序列)
1.题目Given an integer array nums, return all the different possible increasing subsequences of the given array with at least two elements. You may return the answer in any order.The given array may contain duplicates, and two equal integers should also b原创 2021-04-13 23:21:59 · 127 阅读 · 0 评论 -
LeetCode.498 Diagonal Traverse(遍历矩阵)
1.题目Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.Example:Input:[[ 1, 2, 3 ],[ 4, 5, 6 ],[ 7, 8, 9 ]]Output: [1,2,4,7,5,3,6,8,9]Explanation:Note:The tot原创 2021-01-04 00:20:14 · 194 阅读 · 0 评论 -
LeetCode.452 Minimum Number of Arrows to Burst Balloons(最少的箭射泡泡)
1.题目There are some spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter, and hence the x-coordinates of start an原创 2020-12-31 15:56:26 · 130 阅读 · 0 评论 -
LeetCode.386 Lexicographical Numbers(字典序输出连续数)
1.题目Given an integer n, return 1 - n in lexicographical order.For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].Please optimize your algorithm to use less time and space. The input size may be as large as 5,000,000.2.解答class Solution {原创 2020-12-10 23:40:42 · 130 阅读 · 0 评论 -
LeetCode.357 Count Numbers with Unique Digits (统计数字不同的总数)
1.题目Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.2. 样例Example:Input: 2Output: 91 Explanation: The answer should be the total numbers in the range of 0 ≤ x < 100, excluding 11,22,33,4原创 2020-11-07 13:51:23 · 164 阅读 · 0 评论 -
LeetCode.399 Evaluate Division(评估除法)
1.题目You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i]. Each Ai or Bi is a string that represents a single variable.You are also g原创 2020-10-10 23:43:06 · 160 阅读 · 0 评论 -
LeetCode.725 Split Linked List in Parts (将链表分成k段)
1.题目Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list “parts”.The length of each part should be as equal as possible: no two parts should have a size differing by more than 1. This原创 2020-09-12 12:59:27 · 170 阅读 · 0 评论 -
Leetcode.665 Non-decreasing Array(替换一个数成为非降序数组)
1.题目Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.We define an array is non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <= i <= n - 2原创 2020-08-09 21:00:50 · 272 阅读 · 0 评论 -
LeetCode.698 Partition to K Equal Sum Subsets(均分成k组和相等)
1.题目Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all equal.2.输入/输出样例Input: nums = [4, 3, 2, 3, 5, 2, 1], k = 4Output: TrueExplanation: It's possible原创 2020-08-08 09:44:39 · 175 阅读 · 0 评论 -
LeetCode.540 01 Matrix(距离0最近的距离)
1.题目Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.The distance between two adjacent cells is 1.2.输入输出样例子Example 1:Input:[[0,0,0], [0,1,0], [0,0,0]]Output:[[0,0,0], [0,1,0], [0,0,0]]Example 2:Input:[[0原创 2020-07-26 11:28:23 · 279 阅读 · 0 评论 -
LeetCode.738 Monotone Increasing Digits(单调递增的数)
1.题目Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.(Recall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.)2.样原创 2020-06-27 15:56:21 · 164 阅读 · 0 评论 -
LeetCode.658 Find K Closest Elements(查找最近的k个数)
1.题目Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If there is a tie, the smaller elements are alway...原创 2020-05-04 15:44:12 · 322 阅读 · 0 评论 -
LeetCode.678 Valid Parenthesis String
题目Given a string containing only three types of characters: ‘(’, ‘)’ and ‘*’, write a function to check whether this string is valid. We define the validity of a string by these rules:Any left paren...原创 2020-04-22 00:30:27 · 261 阅读 · 0 评论 -
LeetCode.539 Minimum Time Difference(求时间最小间隔)
题目Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list.Example 1:Input: ["23:59","00:00"]Output: 1Note:...原创 2020-03-07 17:07:00 · 763 阅读 · 0 评论 -
LeetCode.303/304 Range Sum Query(2) - Immutable
303.题目(求数组子序列元素之和)Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2...原创 2020-01-30 21:26:23 · 168 阅读 · 0 评论 -
LeetCode.221 Maximal Square(最大正方形面积)
题目Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.Example:Input: 1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0Output: 4分析 class S...原创 2020-01-27 21:16:52 · 195 阅读 · 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.T原创 2017-08-26 22:24:52 · 187 阅读 · 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.注意事项:原创 2017-08-27 11:13:41 · 196 阅读 · 0 评论 -
LeetCode.82(83) Remove Duplicates from Sorted List
83.Remove Duplicates from Sorted List题目:Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2原创 2017-08-27 11:22:39 · 210 阅读 · 0 评论 -
LeetCode.38 Count and Say
题目:The count-and-say sequence is the sequence of integers with the first five terms as following1. 12. 113. 214. 12115. 1112211 is read off as "one 1" or 11.11原创 2017-08-27 11:39:46 · 185 阅读 · 0 评论 -
LeetCode.36 Valid Sudoku
题目:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partia原创 2017-08-27 11:46:20 · 186 阅读 · 0 评论 -
LeetCode.147 Insertion Sort List
题目:Sort a linked list using insertion sort.分析:/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } *原创 2017-09-13 22:02:50 · 177 阅读 · 0 评论 -
LeetCode.148 Sort List
题目:Sort a linked list in O(n log n) time using constant space complexity.分析:时间复杂度nlogn,首先想到的是归并排序或快速排序/** * Definition for singly-linked list. * public class ListNode { * int val;原创 2017-09-22 19:58:58 · 152 阅读 · 0 评论 -
LeetCode.143 Reorder List
题目:Given a singly linked list L: L0?L1?…?Ln-1?Ln,reorder it to: L0?Ln?L1?Ln-1?L2?Ln-2?…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reord原创 2017-09-22 23:51:25 · 144 阅读 · 0 评论 -
LeetCode.92 Reverse Linked List
题目:Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.分析:/** * Definition原创 2017-09-07 11:32:16 · 174 阅读 · 0 评论 -
A general approach to backtracking questions in Java (Subsets, Permutations, Combination Sum, Palind
转载地址:https://leetcode.com/problems/combination-sum/discuss/This structure might apply to many other backtracking questions, but here I am just going to demonstrate Subsets, Permutations, and Com转载 2017-09-15 11:10:33 · 231 阅读 · 0 评论 -
LeetCode.328 Odd Even Linked List
题目:Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to原创 2017-09-23 17:09:20 · 93 阅读 · 0 评论 -
LeetCode.160 Intersection of Two Linked Lists
题目:Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘原创 2017-09-23 20:37:29 · 157 阅读 · 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.分析1(实测较分析2快,易理解):/** * De原创 2017-09-24 00:14:24 · 121 阅读 · 0 评论 -
LeetCode.26(80) Remove Duplicates from Sorted Array
题目:Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in pla原创 2017-08-31 16:08:47 · 157 阅读 · 0 评论 -
LeetCode.209 Minimum Size Subarray Sum
该题与Ch_02最长子序列类似,采用聪明算法,详情参考Ch_02最长子序列题目:Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't原创 2017-08-31 22:17:30 · 168 阅读 · 0 评论 -
LeetCode.206 Reverse Linked List
题目:Reverse a singly linked list.分析:1.非递归实现/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * }原创 2017-09-01 09:47:10 · 166 阅读 · 0 评论 -
LeetCode.52 Maximum Subarray
参考Ch_02最大子序列问题题目: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 contiguo原创 2017-09-01 10:47:08 · 159 阅读 · 0 评论 -
LeetCode.2(445) Add Two numbers(II)
题目1(Add Two Numbers):You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add t原创 2017-09-26 15:32:58 · 193 阅读 · 0 评论 -
LeetCode.142(141) Linked List Cycle && Linked List Cycle (II)
Linked List CycleGiven a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?如何判断一个单链表中有环?Linked List Cycle IIGiven a linked list,转载 2017-09-19 11:35:37 · 343 阅读 · 0 评论