654. Maximum binary tree
Give a non repeating integer array nums. The maximum binary tree can be constructed recursively from nums with the following algorithm:
Create a root node with the maximum value in nums. Recursively construct the left subtree on the subarray prefix to the left of the maximum. Recursively construct the right subtree on ...

Posted by vhaxu on Tue, 05 Apr 2022 09:39:51 +0300

Day 11 - recursion
77. Portfolio
Combination and arrangement are classical recursive backtracking problems, and can be optimized by pruning techniques. Method 1: non pruning recursive backtracking method The combination does not consider the order. M numbers are selected from the given N numbers for combination, and the combined numbers ...

Posted by MajusC00L on Tue, 05 Apr 2022 08:50:12 +0300

->Gitee source code click here<- Structure description: ① There are three parts in a node a.prev pointer: the pointer of the previous node b.data: store valid values c.next pointer: the pointer to the next node ② The linked list has a head node, which does not store valid values, but stores the pointer of the head node and the pointer of ...

Posted by Thunderfunk on Tue, 05 Apr 2022 04:51:06 +0300

Implicit graph search
Experimental task
Preview before class
A * algorithm
Original address: http://www.gamedev.net/reference/articles/article2003.asp
Summary of the A method
Add the starting point to the open list. Repeat the following process:
a. Traverse the open list, find the node with the smallest F value and take it as th ...

Posted by vickie on Mon, 04 Apr 2022 16:25:38 +0300

Operation and experimental data structure of linked list (II)
1, Experimental purpose
1. Master the expression and implementation method of chain storage structure of linear list. 2. Master the algorithm implementation of the basic operation of the linked list.
2, Experimental content
1. Establish a single linked list, and implement inserti ...

Posted by brandye71 on Mon, 04 Apr 2022 10:02:11 +0300

catalogue
1. What is a single linked list
2. Structure of single linked list
3. Open up a new node
4. Insert a node data at the end of the linked list
Image example:
Code example:
5. Delete the node at the end of the linked list
Image example:
Code example:
Call:
Execution effect:
6. Find a node and change a node
Code exam ...

Posted by misxa on Mon, 04 Apr 2022 09:50:01 +0300

Traditional artistic ability 😎
Xiaobian is a freshman with double non undergraduate courses. I won't repeat it. You are welcome to give advice (QQ: 1319365055) Previous blogs Point me! Point me! Please search blogger [know the blue of the sky] Joe Joe's gitee code base (grey man) Welcome to visit, click me!
🎉🎉 Non Keban transcoding com ...

Posted by khaldryck on Mon, 04 Apr 2022 07:37:10 +0300

Start of report content
1, Data structure course design objectives
Data structure is an important basic course of professional technology for computer major and a key core course. The goal of data structure course is to enable students to analyze and study the characteristics of computer processing objects, select appropriate data structure ...

Posted by Topper on Mon, 04 Apr 2022 01:40:48 +0300

summary
1. Direct insertion sorting
1.1 basic idea
Insert a record into the ordered table that has been sorted, so as to get a new table, and the ordered table with the number of records increased by 1
1.2 example
1.3 code implementation
public static void insertSort(int [] nums){
for(int i = 1; i < nums.length; i++) ...

Posted by BostonMark on Mon, 04 Apr 2022 00:38:15 +0300