# Leetcode brush n21-Q67: Binary summation

This is the 23rd day of my participation in the Last Revision challenge of November 2021. The difficulty in simulating the addition of two binary numbers is how to deal with the carry, so if you don't care about space and time, you write it slowly, like

# 【 Graph data structure 】 Comprehensive summary of sorting (II)

(a) The insertion class and the exchange class sort made a more detailed summary, for direct insertion, Hill sort, bubble sort, quick sort requirements to master the comprehensive summary of this article (two) mainly introduces the selection of simple class sort, tree and heap sort, merge sort,

# 【 graph data structure 】 Comprehensive summary of sorting (I)

Understand the basic concepts of sorting as well as its stability, temporal complexity and application scenarios. Proficient in direct insertion sort, split insertion sort, bubble sort these three common sorting algorithm.

# Li Kou Week 246 (ii)

This is the 26th day of my participation in Gwen Challenge. DFS = DFS = DFS = DFS = DFS = DFS = DFS = DFS Is still

# Li Kou Week 248 (Ii)

This is the NTH day of my participation in the August Gwen Challenge. For details, see: August Gwen Challenge 1921. Kill the smallest number of monsters at a time. So if you think about velocity, it's just going from distance

# Week 250 (ii)

This is the 10th day of my participation in the August Genwen Challenge. The details of the activity are as below: August Genwen Challenge 1936. The new minimum number of steps thought analysis looks like a simple traversal but can cause problems when the amount of data is too large. More than one array element needs to be inserted between two adjacent array elements

# 323. The number of connected components in an undirected graph

323. The number of connected components in undirected graphs

# Convert Roman numerals to integers

This is the 18th day of my participation in the Last Revision challenge of November 2021. The analog knows the Corresponding Roman numerals and the formula for calculating them, and we can easily think of replacing Roman numerals with ah

# Li Kou Week 249 (ii)

This is the 8 days I participated in the August Genwen Challenge. For details, see: August Genwen Challenge 1930. Through observation, we find that for the palindrome sequence of length 3, the only requirement for us is the same elements on both sides, from the left and right sides

# Conversion between prefix, infix, and postfix expressions

3 plus 4 times 5 minus 6 that's what we normally see. Although infix expression in accordance with our People's Daily habits of thinking, but the computer in the infix expression, you need to use this tree data structure (thinking, because here, including the concept of the parentheses), if the expression is too complex, so the height of the tree are high, greatly increases the time complexity and space complexity. If converted to a line...

Search