LeetCode
Boston_Kimisong
这个作者很懒,什么都没留下…
展开
-
字符串加减法
字符串相加num1 > 0 && num2 > 0public static String addString(String num1, String num2) { StringBuilder builder = new StringBuilder(); int carry = 0; for(int i = num1.length()-1, j = num2.length()-1; i >= 0 || j >= 0 || carry ==原创 2020-07-07 20:18:24 · 2267 阅读 · 0 评论 -
Java 双栈模拟队列 (LC 232)
核心思路:创建两个栈,主栈和辅助栈,主栈用来存储数据,辅助栈用来调整顺序,保证元素先进先出。当向主栈中添加元素时,首先把主栈中的元素全部加入辅助栈,然后加入该元素,再把辅助栈中的所有元素加入主栈。class MyQueue { private Stack<Integer> stack1; private Stack<Integer> stack2;...原创 2020-03-21 14:43:06 · 196 阅读 · 0 评论 -
LeetCode 11. Container With Most Water (Medium)
Description:Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0...原创 2020-02-18 17:05:42 · 158 阅读 · 0 评论 -
LeetCode 42. Trapping Rain Water (Hard)
Description:Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.The above elevation map is represen...原创 2020-02-14 12:48:29 · 119 阅读 · 0 评论 -
LeetCode 777. Swap Adjacent in LR String (Medium)
Description:In a string composed of ‘L’, ‘R’, and ‘X’ characters, like “RXXLRXRXL”, a move consists of either replacing one occurrence of “XL” with “LX”, or replacing one occurrence of “RX” with “XR”...转载 2020-02-12 10:12:27 · 128 阅读 · 0 评论 -
LeetCode 1057. Campus Bikes (Medium)
DescriptionOn a campus represented as a 2D grid, there are N workers and M bikes, with N <= M. Each worker and bike is a 2D coordinate on this grid.Our goal is to assign a bike to each worker. Am...原创 2020-02-10 05:05:31 · 337 阅读 · 0 评论 -
LeetCode 33. Search in Rotated Sorted Array (Medium)
Description: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]).You are given a target value to search...原创 2020-02-08 17:56:28 · 171 阅读 · 0 评论 -
LeetCode 560. Subarray Sum Equals K (Medium)
Description:Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.Example 1:Input:nums = [1,1,1], k = 2Output: 2Note:The l...原创 2020-01-03 15:18:28 · 143 阅读 · 0 评论 -
LeetCode 1277. Count Square Submatrices with All Ones (Medium)
Description:Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.Example 1:Input: matrix =[ [0,1,1,1], [1,1,1,1], [0,1,1,1]]Output: 15Explanation: The...原创 2020-01-02 14:22:31 · 378 阅读 · 0 评论 -
LeetCode 485. Max Consecutive Ones (Easy) (Dynamic Programming || Sliding Window)
DescriptionGiven a binary array, find the maximum number of consecutive 1s in this array.Example 1:Input: [1,1,0,1,1,1]Output: 3Explanation: The first two digits or the last three digits are cons...原创 2020-01-02 08:20:23 · 147 阅读 · 1 评论 -
LeetCode 78. Subsets (Medium)
DescriptionGiven a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[ [...原创 2020-01-02 06:09:18 · 103 阅读 · 0 评论 -
LeetCode 1151. Minimum Swaps to Group All 1's Together (Medium)
Description:Given a binary array data, return the minimum number of swaps required to group all 1’s present in the array together in any place in the array.Example 1:Input: [1,0,1,0,1]Output: 1Ex...原创 2020-01-01 11:53:24 · 224 阅读 · 0 评论 -
1123. Lowest Common Ancestor of Deepest Leaves (Medium)
Description:Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.Recall that:The node of a binary tree is a leaf if and only if it has no childrenThe depth of the r...原创 2019-12-31 09:24:49 · 138 阅读 · 0 评论 -
LeetCode 865. Smallest Subtree with all the Deepest Nodes (Medium)
Description:Given a binary tree rooted at root, the depth of each node is the shortest distance to the root.A node is deepest if it has the largest depth possible among any node in the entire tree....原创 2019-12-31 09:14:53 · 143 阅读 · 0 评论 -
LeetCode 531. Lonely Pixel I (Medium)
Description:Given a picture consisting of black and white pixels, find the number of black lonely pixels.The picture is represented by a 2D char array consisting of ‘B’ and ‘W’, which means black an...原创 2019-12-30 16:08:47 · 168 阅读 · 0 评论 -
LeetCode 167. Two Sum II - Input array is sorted (Easy)
Description:Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the ...原创 2019-12-29 12:32:59 · 163 阅读 · 0 评论 -
LeetCode 442. Find All Duplicates in an Array (Medium)
Description:Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements that appear twice in this array.Could you do it wit...原创 2019-12-29 05:36:57 · 101 阅读 · 0 评论 -
LeetCode 969. Pancake Sorting (Medium)
Description:Given an array A, we can perform a pancake flip: We choose some positive integer k <= A.length, then reverse the order of the first k elements of A. We want to perform zero or more pa...原创 2019-12-28 15:27:27 · 129 阅读 · 0 评论 -
LeetCode 509. Fibonacci Number (Easy)
Description:The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,F(...原创 2019-12-27 11:47:49 · 139 阅读 · 1 评论 -
LeetCode 221. Maximal Square (Medium)
Description:Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.Analysis:Apply 2D dynamic programming to this problem. Initialize a 2D...原创 2019-12-27 11:43:40 · 101 阅读 · 0 评论 -
LeetCode 561. Array Partition I (Easy)
Description:Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as la...原创 2019-12-26 08:38:31 · 81 阅读 · 0 评论 -
LeetCode 950. Reveal Cards In Increasing Order (Medium)
In a deck of cards, every card has a unique integer. You can order the deck in any order you want.Initially, all the cards start face down (unrevealed) in one deck.Now, you do the following steps r...原创 2019-12-26 03:32:47 · 146 阅读 · 0 评论 -
LeetCode 1266. Minimum Time Visiting All Points (Easy)
Description:On a plane there are n points with integer coordinates points[i] = [xi, yi]. Your task is to find the minimum time in seconds to visit all points.You can move according to the next rules...原创 2019-12-25 11:40:39 · 207 阅读 · 0 评论 -
LeetCode 513. Find Bottom Left Tree Value(Medium)
Description:Given a binary tree, find the leftmost value in the last row of the tree.Example 1:Input: 2 / \ 1 3Output:1Example 2:Input: 1 / \ 2 3 / /...原创 2019-12-24 12:11:59 · 104 阅读 · 0 评论 -
LeetCode 637. Average of Levels in Binary Tree(Easy)
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.Example 1:Input: 3 / \ 9 20 / \ 15 7Output: [3, 14.5, 11]Explanation:...原创 2019-12-24 08:51:16 · 132 阅读 · 0 评论 -
LeetCode 669. Trim a Binary Search Tree(Easy)
Description:Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tr...原创 2019-12-24 07:30:36 · 108 阅读 · 0 评论 -
LeetCode 1120. Maximum Average Subtree(Medium)
Description:Given the root of a binary tree, find the maximum average value of any subtree of that tree.(A subtree of a tree is any node of that tree plus all its descendants. The average value of a...原创 2019-12-23 16:59:51 · 457 阅读 · 0 评论 -
LeetCode 1026. Maximum Difference Between Node and Ancestor(Medium)
Description:Given the root of a binary tree, find the maximum value V for which there exists different nodes A and B where V = |A.val - B.val| and A is an ancestor of B.(A node A is an ancestor of B...原创 2019-12-23 13:40:00 · 208 阅读 · 0 评论 -
LeetCode 889. Construct Binary Tree from Preorder and Postorder Traversal(Medium)
Return any binary tree that matches the given preorder and postorder traversals.Values in the traversals pre and post are distinct positive integers.Example 1:Input: pre = [1,2,4,5,3,6,7], post = [...原创 2019-12-23 10:56:55 · 125 阅读 · 0 评论 -
LeetCode 951. Flip Equivalent Binary Trees (Medium)
For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.A binary tree X is flip equivalent to a binary tree Y if and only if we can...原创 2019-12-22 11:41:02 · 141 阅读 · 0 评论 -
LeetCode 979. Distribute Coins in Binary Tree(超详细分析)
Description:Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.In one move, we may choose two adjacent nodes and move one coin from o...原创 2019-11-26 10:00:24 · 197 阅读 · 0 评论 -
LeetCode 894. All Possible Full Binary Trees (记忆搜索)
Description:A full binary tree is a binary tree where each node has exactly 0 or 2 children.Return a list of all possible full binary trees with N nodes. Each element of the answer is the root node...原创 2019-11-19 03:27:26 · 180 阅读 · 0 评论 -
LeetCode 654. Maximum Binary Tree (Medium)
Description:Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:The root is the maximum number in the array.The left subtree is the maximum tree c...原创 2019-11-13 10:58:52 · 92 阅读 · 0 评论 -
LeetCode 399. Evaluate Division (Medium)
Description:Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers. If...原创 2019-11-12 11:55:24 · 185 阅读 · 0 评论 -
LeetCode 997. Find the Town Judge (Easy)
Description:In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is secretly the town judge.If the town judge exists, then:1.The town judge trusts nobody....原创 2019-11-09 11:52:34 · 119 阅读 · 0 评论 -
LeetCode 765. Couples Holding Hands (Hard)
Description:N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing a...原创 2019-11-09 08:51:22 · 193 阅读 · 0 评论 -
LeetCode 323. Number of Connected Components in an Undirected Graph (Medium)
Description:Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected components in an undirected graph.Ex...原创 2019-11-08 13:16:04 · 136 阅读 · 0 评论 -
LeetCode 1136. Parallel Courses (Hard)
Description:There are N courses, labelled from 1 to N.We are given relations[i] = [X, Y], representing a prerequisite relationship between course X and course Y: course X has to be studied before co...原创 2019-11-08 12:31:43 · 225 阅读 · 0 评论 -
LeetCode 1161. Maximum Level Sum of a Binary Tree (Medium)
Description:Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.Return the smallest level X such that the sum of all the values of nodes at level ...原创 2019-11-01 13:22:48 · 209 阅读 · 0 评论 -
Leetcode 1043. Partition Array for Maximum Sum (Medium)(直观分析)
Description:Given an integer array A, you partition the array into (contiguous) subarrays of length at most K. After partitioning, each subarray has their values changed to become the maximum value ...原创 2019-11-04 08:32:10 · 138 阅读 · 0 评论