LeetCode Algorithm
狗辣子
这个作者很懒,什么都没留下…
展开
-
【Java】【Leetcode】92. Reverse Linked List II
everse a linked list from positionmton. Do it in one-pass.Note:1 ≤m≤n≤ length of list.Example:Input: 1->2->3->4->5->6->7->8->9->NULL, m = 2, n = 4Output: 1->2->7->6->5->4->3->8->9->NULL...原创 2020-12-16 18:00:25 · 208 阅读 · 0 评论 -
【Java】【Leetcode】Search a 2D Matrix II
Write an efficient algorithm that searches for atargetvalue in anm x nintegermatrix. Thematrixhas the following properties:Integers in each row are sorted in ascending from left to right. Integers in each column are sorted in ascending from top t...原创 2020-12-16 14:37:42 · 200 阅读 · 0 评论 -
【Java】【LeetCode】23. Merge k Sorted Lists
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.Example:Input:[ 1->4->5, 1->3->4, 2->6]Output: 1->1->2->3->4->4->5->6思路分析:题目的意思是合并k个有序的链表。这题可以运用分治法,进行...原创 2020-07-22 20:24:59 · 173 阅读 · 0 评论 -
【Java】【LeetCode】214. Shortest Palindrome
Given a strings, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.Example 1:Input: "aacecaaa"Output: "aaacecaaa"Example 2:.原创 2020-07-21 16:58:55 · 171 阅读 · 0 评论 -
【Java】【LeetCode】20. Valid Parentheses
Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.An input string is valid if:Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct or...原创 2020-07-21 17:55:26 · 108 阅读 · 0 评论 -
【Java】【LeetCode】200. 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...原创 2019-11-16 12:00:08 · 126 阅读 · 0 评论 -
【Java】【LeetCode】14. Longest Common Prefix
题目:Write a function to find the longest common prefix string amongst an array of strings.If there is no common prefix, return an empty string"".Example 1:Input: ["flower","flow","flight"]Ou...原创 2019-07-05 15:37:04 · 150 阅读 · 0 评论 -
【Java】【LeetCode】71. Simplify Path
题目:Given anabsolute pathfor a file (Unix-style), simplify it. Or in other words, convert it to thecanonical path.In a UNIX-style file system, a period.refers to the current directory. F...原创 2019-06-28 14:00:27 · 123 阅读 · 0 评论 -
【Java】【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 ...原创 2019-07-11 11:23:48 · 106 阅读 · 0 评论 -
【Java】【LeetCode】100. Same Tree
题目:Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Exa...原创 2019-07-11 14:48:02 · 114 阅读 · 0 评论 -
【Java】【LeetCode】111. Minimum Depth of Binary Tree
题目:Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.Note:A leaf is a node with no ch...原创 2019-07-11 15:48:26 · 97 阅读 · 0 评论 -
【Java】【LeetCode】129. Sum Root to Leaf Numbers
题目:Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which represents the number123.Find the...原创 2019-07-15 12:26:26 · 106 阅读 · 0 评论 -
【Java】【LeetCode】36. Valid Sudoku
题目:Determine if a9x9 Sudoku boardis valid.Only the filled cells need to be validatedaccording to the following rules:Each rowmust contain thedigits1-9without repetition. Each column must ...原创 2019-07-16 12:34:20 · 115 阅读 · 0 评论 -
【Java】【LeetCode】73. Set Matrix Zeroes
题目:Given amxnmatrix, if an element is 0, set its entire row and column to 0. Do itin-place.Example 1:Input: [ [1,1,1], [1,0,1], [1,1,1]]Output: [ [1,0,1], [0,0,0], [1,0,1]...原创 2019-07-18 16:16:14 · 85 阅读 · 0 评论 -
【Java】【LeetCode】75. Sort Colors
题目:Given an array withnobjects colored red, white or blue, sort themin-placeso that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use t...原创 2019-07-05 14:50:50 · 125 阅读 · 0 评论 -
【Java】【LeetCode】112. Path Sum
题目:Given 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.Note:A leaf is a node with no children.Exa...原创 2019-07-10 18:59:41 · 116 阅读 · 0 评论 -
【Java】【LeetCode】104. Maximum Depth of Binary Tree
题目:Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Note:A leaf is a node with no ch...原创 2019-07-10 18:39:56 · 92 阅读 · 0 评论 -
【Java】【LeetCode】49. Group Anagrams
题目:Given an array of strings, group anagrams together.Example:Input: ["eat", "tea", "tan", "ate", "nat", "bat"],Output:[ ["ate","eat","tea"], ["nat","tan"], ["bat"]]Note:All inputs...原创 2019-07-09 16:35:22 · 89 阅读 · 0 评论 -
【Java】【LeetCode】121. Best Time to Buy and Sell Stock
题目:Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the st...原创 2019-07-09 16:59:17 · 102 阅读 · 0 评论 -
【Java】【LeetCode】29. Divide Two Integers
题目:Given two integersdividendanddivisor, divide two integers without using multiplication, division and mod operator.Return the quotient after dividingdividendbydivisor.The integer divisio...原创 2019-07-04 11:28:05 · 186 阅读 · 0 评论 -
【Java】【LeetCode】53. Maximum Subarray
题目:Given an integer arraynums, find the contiguous subarray(containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Expl...原创 2019-07-09 18:19:53 · 197 阅读 · 0 评论 -
【Java】【LeetCode】26. Remove Duplicates from Sorted Array
题目:Given a sorted arraynums, remove the duplicatesin-placesuch that each element appear onlyonceand return the new length.Do not allocate extra space for another array, you must do this bymo...原创 2019-07-04 15:00:34 · 92 阅读 · 0 评论 -
【Java】【LeetCode】94. Binary Tree Inorder Traversal
题目:Given a binary tree, return theinordertraversal of its nodes' values.Example:Input: [1,null,2,3] 1 \ 2 / 3Output: [1,3,2]Follow up:Recursive solution is trivial, co...原创 2019-07-10 17:00:30 · 144 阅读 · 0 评论 -
【Java】【LeetCode】144. Binary Tree Preorder Traversal
题目:Given a binary tree, return thepreordertraversal of its nodes' values.Example:Input:[1,null,2,3] 1 \ 2 / 3Output:[1,2,3]Follow up:Recursive solution is trivial, ...原创 2019-07-10 18:06:57 · 154 阅读 · 0 评论 -
【Java】【LeetCode】238. Product of Array Except Self
题目:Given an arraynumsofnintegers wheren> 1, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Example:Input: [1,2,3,4]Out...原创 2019-07-23 16:43:53 · 108 阅读 · 0 评论 -
【Java】【LeetCode】39. Combination Sum
题目:Given asetof candidate numbers (candidates)(without duplicates)and a target number (target), find all unique combinations incandidateswhere the candidate numbers sums totarget.Thesamer...原创 2019-07-16 18:42:57 · 103 阅读 · 0 评论 -
【Java】【LeetCode】179. Largest Number
题目:Given a list of non negative integers, arrange them such that they form the largest number.Example 1:Input: [10,2]Output: "210"Example 2:Input: [3,30,34,5,9]Output: "9534330"Note:...原创 2019-07-22 14:32:38 · 159 阅读 · 0 评论 -
【Java】【LeetCode】165. Compare Version Numbers
题目:Compare two version numbersversion1andversion2.Ifversion1>version2return1;ifversion1<version2return-1;otherwise return0.You may assume that the version strings are non-emp...原创 2019-07-22 14:52:38 · 95 阅读 · 0 评论 -
【Java】【LeetCode】338. Counting Bits
题目:Given a non negative integer numbernum. For every numbersiin the range0 ≤ i ≤ numcalculate the number of 1's in their binary representation and return them as an array.Example 1:Input: 2...原创 2019-07-27 17:18:09 · 253 阅读 · 0 评论 -
【Java】【LeetCode】905. Sort Array By Parity
题目:Given an arrayAof non-negative integers, return an array consisting of all the even elements ofA, followed by all the odd elements ofA.You may return any answer array that satisfies this co...原创 2019-08-06 18:41:06 · 96 阅读 · 0 评论 -
【Java】【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 do it...原创 2019-08-14 18:58:02 · 157 阅读 · 0 评论 -
【Java】【LeetCode】62. Unique Paths
题目:A robot is located at the top-left corner of amxngrid (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 t...原创 2019-08-25 14:20:57 · 116 阅读 · 0 评论 -
【Java】【LeetCode】47. Permutations II
题目:Given a collection of numbers that might contain duplicates, return all possible unique permutations.Example:Input: [1,1,2]Output:[ [1,1,2], [1,2,1], [2,1,1]]题解:这道题跟Permutaiton...原创 2019-08-22 16:37:56 · 77 阅读 · 0 评论 -
【Java】【LeetCode】63. Unique Paths II
题目:A robot is located at the top-left corner of amxngrid (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 t...原创 2019-08-27 12:43:47 · 138 阅读 · 0 评论 -
【Java】【LeetCode】64. Minimum Path Sum
题目:Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:You can only move either down or right...原创 2019-08-28 16:50:00 · 154 阅读 · 0 评论 -
【Java】【LeetCode】260. Single Number III
题目:Given an array of numbersnums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.Example:Input: [1...原创 2019-07-30 22:25:31 · 118 阅读 · 0 评论 -
【Java】【LeetCode】228. Summary Ranges
题目:Given a sorted integer array without duplicates, return the summary of its ranges.Example 1:Input: [0,1,2,4,5,7]Output: ["0->2","4->5","7"]Explanation: 0,1,2 form a continuous range...原创 2019-07-21 16:37:14 · 143 阅读 · 0 评论 -
【Java】【LeetCode】334. Increasing Triplet Subsequence
题目:Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the function should:Return true if there existsi, j, ksuch thatarr[i]<...原创 2019-07-21 15:42:56 · 118 阅读 · 0 评论 -
【Java】【LeetCode】152. Maximum Product Subarray
题目:Given an integer arraynums, 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: 6Explanation:[...原创 2019-07-23 22:22:34 · 140 阅读 · 0 评论 -
【Java】【LeetCode】5. Longest Palindromic Substring
题目:Given a strings, find the longest palindromic substring ins. You may assume that the maximum length ofsis 1000.Example 1:Input: "babad"Output: "bab"Note: "aba" is also a valid answer....原创 2019-07-17 12:32:10 · 119 阅读 · 0 评论