## Transformer hardware implementation part 2: supplement to pytoch basic knowledge

This article is a supplement to the knowledge of pytorch before training Transformer. Thank blogger Mo fan for his video course on Python https://www.youtube.com/watch?v=lAaCeiqE6CE&feature=emb_title , whose home page is: Don't bother Python It is recommended to directly watch the blogger's video tutorial to complete the knowledge suppleme ...

## Leetcode brush summary 17 - 19 -- dfs

(1) LeetCode17: letter combination of telephone numbers This problem is a very classic dfs problem, the brute force search problem. When you don't think clearly about the dfs problem, you can draw a tree and enumerate the situations: (the tree of the number mapping problem is as follows, but this is part of the tree) After drawing this tree, ...

## [case of thousands of algorithms] β‘ Daily LeetCode punch in β‘ - 50. Missing numbers

π’ preface π Algorithm problem π π² Punching out an algorithm problem every day is not only a learning process, but also a sharing process ππ² Tip: the problem-solving programming languages in this column are C# and Javaπ² To maintain a state of learning every day, let's work together to become the great God of algorithm π§!π² To ...

## One article deals with ten classical sorting algorithms

One article deals with ten classical sorting algorithms Today I'll sort through the top ten classical sorting algorithms. 1. Bubble sort - Smaller elements will slowly "float" to the top of the column by swapping Algorithm demonstration Algorithmic steps Compare adjacent elements. If the first is larger than the second, swap t ...

## 10 minutes to thoroughly understand the adaptive large neighborhood search algorithm

Algorithm Introduction Adaptive Large Neighborhood Search algorithm (ALNS), for short, is a heuristic method proposed by Ropke and Pisinger in 2006. It increases the measurement of the effect of operators on the basis of neighborhood search, so that the algorithm can automatically select good operators to destroy and repair the solution, so ...

## Brush from binary tree -- familiar with recursive routine

Recently, I wanted to brush some questions systematically, found a lot of materials and courses, and finally found that labuladong's problem brushing scheme was more suitable for me, so I began to follow it labuladong's algorithm Start to brush questions, hope you can stick to it, grow all the time, come on. 226. Flip binary tree Flip binary ...

## Phase 1 report of thousands of questions [to be summarized further]

Overview of learning content Objective: To find the feel of programming and problem solving Specific training content: Thought Map There are also some previous questions Summary after practice After the details are added to the text version, the overview mind map is as follows: Programming Details Bit operation skills ...

## week6 trie+union+heap

1. trie βββββββnews 1, 835.Trie string statistics //son[p][u] represents u children of P node #include<iostream> using namespace std; const int N=1e5+10; int son[N][26],cnt[N],idx;//cnt stores the number of occurrences of each string, and the idx subscript is the point of 0, which is either the root node or the empty node void insert( ...

## Backtracking - the nearest common ancestor of the binary tree to judge or record the path from top to bottom

Sword finger Offer 64. Find 1 + 2 +... + n For 1 + 2 +... + n, it is required that keywords such as multiplication and division, for, while, if, else, switch, case and conditional judgment statements (A?B:C) cannot be used. When you come across this kind of problem, because your mind is hard to use, you can look at the problem solution direct ...

## [C/C + + backend development and learning] 1 sorting, KMP, linked list

1 sort Comparison of sorting algorithms Comparison of sorting algorithms (Reprint) Stability of sorting algorithm: Assuming that there are multiple records with the same keyword in the sequence to be sorted, if the relative order of these records remains unchanged after sorting, the sorting algorithm is said to be stable. In sh ...