Java

Original Web site:http://algs4.cs.princeton.edu/linux/Part. I[username:~/][username:~/] mkdir algs4[username:~/] CD algs4[username:~/algs4/] mkdir bin[username:~/introcs/] sudo apt-get update[username:~/introcs/] sudo apt-get Install

To figure out the difference between int and integer, you need to figure out what the wrapper class is.Although the Java language is a typical object-oriented programming language, the 8 basic data types do not support object-oriented programming

1 ConceptsSocket:socket is actually an encapsulation of TCP/IP, and we can use socket sockets to transmit through the socket. The first thing we need to understand is that the channel is simply a channel that is two pairs of channels that can

Java transaction (8)-distributed transaction-spring + JTA + atomikos I. Preface: In the previous blog, we used jotm to implement distributed transactions. This article uses atomikos. The basic code is the same, that is, the configuration is slightly

F00007usart Data Processing Program Resolution: usart automatically sends data solutions on the Cortex-M4. 1. usart is interrupted too quickly. The data has not been processed. The usart interrupt overwrites the unprocessed data. Data loss. 2. This

Java multithreading (2) -- thread Creation I. Two Methods for creating threads in java 1. A new Thread class is derived from the java. lang. Thread class, and its run () method is reloaded. 2. Implement the Runnable interface and reload the run ()

Programming Algorithm-code for inserting an ordered double-loop linked list (C)Code for inserting an ordered double-loop linked list (C)       Ordered double-cycle linked listInsert, you need to find the Insert Location, you can use,Two pointers,

Quick Sort function Template During this time, I was obsessed with STL and made some research. Today I wrote a new quick sorting algorithm using the template function and posted the code to share it. There are two versions. Version 2 can pass in the

Java path acquisition Package unit02;/***** @ time September 18, 2014 10:29:48 * @ porject ThinkingInJava * @ author Kiwi */public class Test03 {private String getPathByPoint () {return this. getClass (). getClassLoader (). getResource (". ").

The beauty of programming: deleting a node from a single-chain table without headers. 1. Problem Description Suppose there is a single-chain table without a header pointer. A pointer points to a node (not the first or the last) in the middle of the

Graph Algorithm (7) --- use the query set to find the Minimum Spanning Tree The most typical algorithm is the prim algorithm and the kruskal algorithm. In terms of time efficiency, kruskal is superior. For the implementation of kruskal, here we use

Starting with such simple codeStarting from such a simple code, I discussed the following method in the company's technical group some time ago, which is faster. public class Demo {private int count; const int maxNum = int. maxValue; public void Run1

Spring framework: Spring container detailsSpring container Spring containers can help you manage all Bean objects. The terminology is IoC control inversion. In traditional programs, objects are generated by developers. In the control reversal, all

Android pull Parsing Pull parsing XMLThe XmlPullParser parser runs in a similar way as the SAX Parser. it provides similar events (Start Element and end element), but uses parser. the next () method to extract them. the event is sent as a numeric

Automatic Assembly in Spring Automatic Assembly We have learned that in constructor-arg and property assembly, you must configure the corresponding attributes and values or references. If you are in a complicated project, the XML configuration will

Priority Queue (HEAP) Priority QueuePriority Queue Definition & Description: In computer science/data structures, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element

Spring internal bean and space naming Internal bean In fact, the internal bean is very easy to assemble a bean inside a bean, so the internal bean cannot be used by other beans at this time. Generally, beans under the beans node can be used by any

Infix expression to suffix expressionInfix expression to suffix expression 1. Basic Concepts There are three expressions in a computer: prefix expression (Polish expression), infix expression, and suffix expression (inverse polish expression ). For

Sorting Algorithm for algorithm learning: heap sorting To understand heap sorting, first understand the concept of heap, because this article mainly studies the heap sorting algorithm. Here we only give the concept of the data structure heap: the

Java multithreading ~~~ Multi-thread Implementation of ReadWriteLock read/write splitting In multi-threaded development, there is often a situation where we want read/write splitting. For reading this action, there can be multiple threads at the