hackerrank vs leetcode

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: Best Time to Buy and keep Stock IV, leetcode= Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most k transactions.Note:You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again). This question has been done in Best Time to Buy and Stock III

[LeetCode-interview algorithm classic-Java implementation] [014-Longest Common Prefix (Longest Common Prefix)], leetcode -- java [014-Longest Common Prefix (Longest Common Prefix )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Write a function to find the longest common prefix string amongst an a

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

[LeetCode-interview algorithm classic-Java implementation] [011-ContainerWithMostWater (the most water)], leetcode -- java [011-ContainerWithMostWater (Maximum capacity of water )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given n non-negative integers a1, a2 ,..., An, where each represents a

[LeetCode-interview algorithm classic-Java implementation] [007-Reverse Integer (Flip Integer)], leetcode -- java [007-Reverse Integer (Flip Integer )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Reverse digits of an integer.Example1: x = 123, return 321Example2: x =-123, return-321 Theme Enter

[LeetCode-interview algorithm classic-Java implementation] [006-ZigZag Conversion (Z-type Conversion)], leetcode -- java [006-ZigZag Conversion (Z-type Conversion )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows l

[LeetCode-interview algorithm classic-Java implementation] [008-String to Integer (atoi) (String to Integer)], leetcode -- java [008-String to Integer (atoi) (String to Integer )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Implement atoi to convert a string to an integer.Hint: Carefully conside

[LeetCode-interview algorithm classic-Java implementation] [021-Merge Two Sorted Lists (Merge Two Sorted Single-Chain tables)], leetcode -- java [021-Merge Two Sorted Lists )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Merge two sorted linked lists and return it as a new list. The new list shos

[LeetCode-interview algorithm classic-Java implementation] [056-Merge Intervals (range Merge)], leetcode -- java [056-Merge Intervals (Merge Intervals )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,1

[LeetCode-interview algorithm classic-Java implementation] [077-Combinations (number of Combinations)], leetcode -- java [077-Combinations (number of Combinations )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given two integers n and k, return all possible combinations of k numbers out of 1...

[LeetCode-interview algorithm classic-Java implementation] [029-Divide Two Integers (Division of Two Integers)], leetcode -- java [029-Divide Two Integers (Division of Two Integers )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Divide two integers without using multiplication, division and mod o

[LeetCode-interview algorithm classic-Java implementation] [024-Swap Nodes in Pairs (node of the paired exchange single-chain table)], leetcode -- java [024-Swap Nodes in Pairs (node of the paired exchange single-chain table )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a linked list, swa

[LeetCode-interview algorithm classic-Java implementation] [063-Unique Paths II (Unique path Question II)], leetcode -- java [063-Unique Paths II (Unique path Problem II )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Follow up for "Unique Paths ":Now consider if some obstacles are added to the g

[LeetCode-interview algorithm classic-Java implementation] [057-Insert Interval (Insert Interval)], leetcode -- java [057-Insert Interval (Insert Interval )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if n

[LeetCode-interview algorithm classic-Java implementation] [215-Kth Largest Element in an Array (number of K in the Array)], leetcode -- java [215-Kth Largest Element in an Array (number of K in the Array )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Download the Code [https://github.com/wang-jun-chao]Original q

[LeetCode-interview algorithm classic-Java implementation] [217-Contains Duplicate (including Duplicate elements)], leetcode -- java [217-Contains Duplicate (including Duplicate elements )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Download the Code [https://github.com/wang-jun-chao]Original question Given an a

[LeetCode-interview algorithm classic-Java implementation] [100-Same Tree (whether the two sides are the Same)], leetcode -- java [100-Same Tree (whether the two trees are the Same )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given two binary trees, write a function to check if they are equal

[LeetCode-interview algorithm classic-Java implementation] [066-Plus One (add One)], leetcode -- java [066-Plus One (Plus One )][LeetCode-interview algorithm classic-Java implementation] [directory indexes for all questions]Original question Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the m