Leetcode Problem Solving Report:
[Leetcode] 1.Two Sum-yoona-Blog Channel-csdn.net [Leetcode]2.add-Numbers-yoona-Blog Channel-csdn.net [Leetcode]3.longest Substring Wi Thout repeating Characters-yoona-Blog channel-csdn.net [Leetcode]4.median of the Sorted Arrays-yoona-Blog C

LeetCode summary, leetcodeNumerical Computation is very practical and common in the industry, so the frequency of interviews is very high. It is almost a required question. LeetCode has the following questions about numerical calculation:Palindrome NumberReverse IntegerSqrt (x)Pow (x, n)Divide Two IntegersMax Points on a LineIn LeetCode, there are three types of

LeetCode summary, leetcodeThe sum of trees is a common topic in the tree. There can be several variants with high flexibility and understanding of the data structure and recursion of the tree. In general, these questions do not need to consider non-recursive solutions (although the truth is the same as the LeetCode Summary-tree traversal, as long as you master it, it should be OK ). In

[LeetCode]-002-Add Two Numbers, leetcode-002-add
Web: https://leetcode.com/problems/add-two-numbers/
Question:
Can be used for addition of large numbers,
The values start from the low position and end to end. If the value is greater than or equal to 10, the values are carried.
Tip:
(1) l1 is null or l2 is null
(2) l1 is longer than l2 or l2 is longer than l1
(3) The highest bit in l1 and l2 is still

Leetcode: Binary_Tree_Level_Order_Traversal_II, leetcode
I. Question
Given a binary tree, return the value of its node through hierarchical traversal from the bottom up. (That is, from left to right, layer by layer from the leaves to the root directory ).
Example: 3 output: [15, 7],
/\ [9, 20]
9 20 [3]
/\]
15 7
Ii. Analysis
When you see the question, you first think of layered traversal. Each layer is saved

Leetcode: remove_element, leetcode
I. Question
Given an array and a value, delete the elements equal to the given value. Returns the length of the new array.
Ii. Analysis
At the beginning, I thought I only needed to return the final array length! After WA, we realized that we had to construct the array of hearts. Therefore, we can scan the array to save unequal values and delete equal values. The elements s

LeetCode summary, leetcodeBit operations have always been a required topic for programming and interviews. However, there are not many bit operations in the interview. The main reason is that bit operations are too skillful. In many cases, it is difficult to come up with bit operations in a short time, therefore, it takes a little time to answer questions for the interview. In LeetCode, there are the follow

[LeetCode] Leetcode (C ++/Java/Python/SQL), leetcodepython
All the latest questions can be found on my github. Welcome to star and watch ~Updating ~~Description
This series of questions includes algorithm questions on leetcode written in C ++/Java/Python and database questions on leetcode written in SQL.Some questions

[LeetCode] 030. Substring with Concatenation of All Words (Hard) (C ++/Java), leetcode
Index: [LeetCode] Leetcode index (C ++/Java/Python/SQL)Github: https://github.com/illuz/leetcode030. Substring with Concatenation of All Words (Hard)
Link:
Title: https://oj.leetcode.com/problems/substring-with-concatenation-of-all-w

All the latest puzzle can be found on my GitHub, welcome star and watch ~Update in ~ ~DescriptionThe problem of this series includes the algorithm topic on Leetcode written by C++/java/python, and the database topic on Leetcode written by SQL.Some of the topics although AC has not yet written analysis, so this time to open a hole to complete.Link:My GitHubLeetcode Algorithms problemsLeetcode Database Proble

Leetcode-java (updated every day) and leetcode-java
NOTE: If java is used, the performance is not optimal. Please refer to the following link for more information: http://www.ming-yue.cn/leetcode-java-solutions /.
First, give an existing leetcode answer. Why do you give the answer directly? because many of the answers

Leetcode: balanced_binary_tree, leetcode
I. Question
Determine whether the given binary tree is a balanced binary tree, that is, the depth difference of each node is not greater than 1
Ii. Analysis
We generally think of recursion for tree problems, and the same is true for this question. We only need to determine whether the left and right subtree of each node are balanced.
Recursion, recursion, recursion .

LeetCode summary, leetcodeSome of our common basic data structures, such as integer int or floating point float, cannot be stored with built-in data because of too many digits. At this time, we need to implement high-precision data types for storage and computation. This problem is more practical in actual products, so it is also a frequent visitor in the interview. In LeetCode, there are the following high

Leetcode subsetGiven a set of distinct integers, S, return all possible subsets.Note:
Elements in a subset must is in non-descending order.
The solution set must not contain duplicate subsets.
For example,If S = [1,2,3] , a solution is:[ 3], [1], [2], [1,3], [+] , [2,3], [up ], []]Topic Analysis:This return all possible question can use the BFS method to solve the idea is to first sort the array (because the title is required t

LeetCode summary, leetcodeThe topic of this article is dynamic planning. It mainly introduces the question of one-dimension dynamic planning in LeetCode. The list is as follows:Climbing StairsDecode WaysUnique Binary Search TreesMaximum SubarrayBest Time to Buy and Buy StockBefore introducing the specific questions above, let's talk about the general idea of dynamic planning. Dynamic Planning is an algorith

LeetCode summary, leetcodeThis article mainly introduces several questions about kSum in LeetCode. The main requirement is to find the number of k in the array and whether it can reach the target value. LeetCode:Two Sum3Sum3Sum Closest4SumFirst of all, starting with Two Sum, this question provides the basic idea of the next k> 2 questions and is also the most frequently tested questions (Amazon's interview

[LeetCode] Best Time to Buy and Buy Stock I II III IV problem solving report, leetcode=Best Time to Buy and Buy Stock I
Question:An array is used to represent the daily price of the stock, and the number of I in the array indicates the price of the stock on the day I. If only one transaction is allowed, that is, only one stock can be bought and sold for the maximum benefit.
Analysis:Dynamic Programming Meth

[LeetCode-interview algorithm classic-Java implementation] [009-Palindrome Number (Number of replies)], leetcode -- java [009-Palindrome Number (Number of replies )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question
Determine whether an integer is a palindrome. Do this without extra space.
Theme
Deter

[LeetCode-interview algorithm classic-Java implementation] [017-Letter Combinations of a Phone Number (word Combinations on Phone numbers)], Chapter 9 leetcode [017-Letter Combinations of a Phone Number (a word combination on the Phone Number )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question
Given

[LeetCode-interview algorithm classic-Java implementation] [013-Roman to Integer (Roman to Integer)], leetcode -- java [013-Roman to Integer (Roman to Integer )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.