Github repository for animated leetCode problem solutions:
Github.com/MisterBooo/…
Over 15000 star: Animation of ideas for solving LeetCode problems
000: Animation demonstration of ten classic sorting algorithms, programmers interview essential
001: The first question on leetCode:
Given an array of integers and a target value, find the two numbers in the array that neutralize the target value.
For example, given the array [2, 7, 11, 15], the target value is 9, the sum of the first two elements of the array 2 + 7 = 9, so 2 and 7 are the two numbers to find.
An animated demo of this problem can be seen on Github:
Implementation of the source code:
The oldest string without repeating characters:
Delete the animation of the penultimate node of the linked list:
Valid parenthesis detection algorithm:
Linked list node switching algorithm:
Array duplicate element deduplicating:
Color classification solution:
Linked list separation algorithm:
Linked list inversion algorithm:
Binary tree order traversal calculation method:
Zigzag level traversal of binary trees
Hierarchical traversal of binary trees II
Evaluate the inverse Polish expression
Right view of a binary tree
This github action is from the Github repository: github.com/liuyubobobo…
For more of Jerry’s original articles, please follow the public account “Wang Zixi “:
