## Data Structure Code Title--Day04

Summary of Data Structure Code Title Title 01 Title Description: The data values of the nodes of all elements in a single-chain table with a leading node are out of order. Try writing a function to delete all elements in the table between a given two values 1. Algorithmic ideas Delete nodes under specified conditionsFind the specified node ...

## Solution to the 261st weekly game of LeetCode

2021.10.3 the 259th weekly match 2027. Minimum number of operations to convert strings thinking Traverse from front to back. If the current character is X, convert it. Change one character to three characters code class Solution { public: int minimumMoves(string s) { int ans = 0; int n = s.size(); for (int i = 0 ...

## C++ for High Precision Addition, High Precision Subtraction, High Precision Multiplication, High Precision Subtraction and Comments on Ideas

Here's some crap: As early as I was learning about the Reproduction of Fibonacci Rabbits, there was an overflow of values beyond a certain input value. At that time, my teacher asked me how my program should handle big data operations. Years later (?! You're funny to say), I finally had a chance to learn this operation again. Since I learned ...

## String ----- 8. Appearance sequence

Day 11: appearance series Title Link: https://leetcode-cn.com/leetbook/read/top-interview-questions-easy/xnpvdm/ Title: Given a positive integer n, the nth item of the appearance sequence is output. "Appearance sequence" is a sequence of integers. Starting from the number 1, each item in the sequence is a description of the previo ...

## Data structure job 1 unary sparse polynomial calculator

Univariate sparse polynomial calculator [problem description] Design a simple calculator for unary sparse polynomials. [basic requirements] The basic functions of the simple calculator for univariate sparse polynomials are: (1) Input and establish polynomials; The input coefficient is a real number and the input exponent is an integer (2) Outp ...

## LeetCode brush questions -- binary tree 2

level traversal Traverse the binary tree layer by layer, breadth first search. The node is saved with a queue, and the queue is added to the head node. If the queue is not empty, the loop body is executed. Record the length of the queue at the moment and enter another cycle. The length is the number of cycles. Use t to record the header e ...

## Java process control statement

3. Process control statement (application) In the process of a program execution, the execution order of each statement has a direct impact on the result of the program. Therefore, we must know the execution process of each statement. Moreover, we often need to control the execution order of statements to achieve the functions we want. 3.1 cl ...

## Answer + analysis of "Python daily practice" on October 4, 2021

1. Input a string containing English letters, numbers, spaces and other characters from the keyboard, and realize the following functions respectively: 1) Count the English letters that appear twice in the string (case sensitive); 2) Count the number appearing n times in the string, and N is input from the keyboard. #First question s= ...

## Codeforces Round #746 (Div. 2)

Introduction daily Knowledge points involved Greed, thinking, sorting, bit operation, tree, DFS order Link: Codeforces Round #746 (Div. 2) subject A Gamer Hemose Main idea of the topic: n weapons, each weapon has its own damage value, and the enemy has H health. Each time you traverse these n weapons, you can choose any weapon to att ...

## Stone game (prefix and enumeration)

Original question link https://www.acwing.com/problem/content/3996/ Title Description yes n The number of stones is a1,a2,...,an. Now, you need to take stones so that the number of all stones is the same. The specific process of one round of stone taking operation is as follows: Set an upper limit on the number of stones h. Check each pil ...