Programmer Group

The experiment in this chapter is quite interesting. Simply record the practice. 1, partA partA is relatively simple. It should be noted that the use of LRU and different lines in the same set do not store continuous addresses. Take s = 1, E = 2, b = 1 as an example: the first row of the first set stores 0x2 0xa ···, ...

preface This blog mainly introduces Python's magic functions. In depth learning or python programming, python class writing will be more or less involved, including Python magic functions. For example, when writing a data loading generator, it may be involved__ next__，__ iter__ Function. Of course, the generator may be done with the keywo ...

JavaScript data structure and algorithm (VII) bidirectional linked list One way linked list and two-way linked list Unidirectional linked list You can only traverse from beginning to end or from end to end (generally from beginning to end).The linked list connection process is one-way. The implementation principle is that there is a referenc ...

Preface description Algorithm learning, daily problem brushing records. Topic connection Perfect rectangle Topic content Give you an array of rectangles, where rectangles[i] = [xi, yi, ai, bi] represents a rectangle with parallel coordinate axes. The lower left vertex of the rectangle is (xi, yi) and the upper right vertex is (ai, bi). Re ...

13. Given two strings containing only lowercase letters, calculate the length of the maximum common substring of the two strings. Note: the definition of substring refers to a string formed after deleting some prefixes and suffixes (or not deleted). import java.util.*; public class Main{ public static void main(String[] args) { Sca ...

Title: Please realize one   myAtoi(string s)   Function to convert a string into a 32-bit signed integer (similar to the atoi function in C/C + +). function   The algorithm of myAtoi(string s) is as follows: Read in the string and discard useless leading spaces Check whether the next character (assuming it has not reached the ...

Learning resources: Pull hook Education What is a ranking problem Sorting - the process of turning a group of unordered data into order. Generally, the order here is from small to large by defaultMeasure the advantages and disadvantages of a sorting algorithm Time complexity - specifically, the best time complexity, the worst time complexi ...

For example: int []arr= {25,69,80,57,13,}; Basic idea of bubble sorting (from small to large): compare a[0] with a[1]. If the former is greater than the latter, exchange it before and after, otherwise no operation will be done. After this step, the larger value will be in the latter, that is, a[1]. Now we need to continue to compare to the bac ...

Clone graphTitle Description: give you a reference to a node in an undirected connected graph. Please return a deep copy (clone) of the graph.Each node in the graph contains its value val (int) and a list of its neighbors (list[Node]).See LeetCode's official website for an example.Source: LeetCode Link: https://leetcode-cn.com/probl... The co ...

Title Description: let a machine be controlled by n It consists of two parts, and each part can be m From different suppliers. supplier j Supplied parts i With weight Wij And price Cij . Design an algorithm to solve the total price does not exceed the upper limit c The minimum weight of the machine. (design a branch a ...