Java

Collection:ArrayList:1: The underlying implementation is an array, the default length is 10.2:add (), determines whether the array is out of bounds, is the array expansion of twice times the original.3:remove (), copy array, size-1, frees up empty

Once eclipse installs the Maven plugin, create an OSGi project with Maven archetype and build a project skeleton.The executable jar file is divided into two types, one is a jar file that can be run directly by the command line Java-jar Xxx.jar, and

Given an index K, return the kth row of the Pascal ' s triangle.For example, given k = 3,Return [1,3,3,1] .Note:Could optimize your algorithm to use only O(k) extra space?The extended version of the previous question is to directly find the number

Java.lang.reflect.MethodI. What is the method class?Method is a class that is located under the Java.lang.reflect package.In Java reflection, the method class describes the methods of the class, and in layman's terms there is a class like this:1

Simple factory:Advantages of a simple factory:1. Remove the client-to-product coupling, add a factory class to the client and the specific product, and increase the coupling between the client and the factory class2. Encapsulate the factory class,

The Java program runs without class loading, so-called class loading is the JVM that loads the compiled class file and forms the class object, and only the class is loaded correctly to be instantiated and invoked.　　 Public class Test {

When making an account decision, it's a bit of a hassle if you judge each other.Single character judgmentString string1 = "[ABC]"; The brackets represent a single character and cannot match the string System.out.println ("a". Matches (string1));

Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along, the shortest path from the root node to the nearest leaf node.Find the lowest height of the tree. There is no skill in using the queue to return results when

Original address: http://www.journaldev.com/122/java-concurrenthashmap-example-iterator#comment-27448Today we'll look into Java concurrenthashmap Example. If you is a Java Developer, I am sure that must is aware of that

This is a count lock, plainly, is when you lock, only when the count is reduced to 0, will release the lock Package cn.xf.cp.ch05; Public class Implements runnable{ @Override publicvoid run () { System.out.println ( "Do something ..

1. Print Rectangle*************************The code is as follows:public class cfx{public static void Main (string[] args) {for (int x=0;xfor (int y=0;ySystem.out.print ("*");}System.out.println ();}}}2. Printing triangles***************The code is

1. Two most basic Java recovery algorithms: copy algorithm and tag cleanup algorithm                 Copy algorithm: two regions A and b, the initial object in a, the object that continues to survive is transferred to B. This is the most commonly

Java final data and javafinal data Many programming languages have their own solutions to tell the compiler that a piece of data is a constant ". Constants are mainly used in the following two aspects: 1) The compile-time constant, which will

Java blank final, javafinal Java 1.1 allows us to create "blank final", which belongs to some special fields. Although declared as final, no initial value is obtained. In either case, Blank final MUST be correctly initialized before actual use

HashSet HashTable and TreeSet, hashsettreesetHashSet class The HashSet class is mainly designed for performing high-performance set operations, such as intersection, union, and difference sets for two sets. Set contains a group of elements that do

JAVA design mode: Template mode; java design mode Template In the book "JAVA and patterns" by Dr. Yan Hong, he first described the Template Method mode as follows: 　　The template method mode is the behavior mode of the class. Prepare an abstract

Struts2 simple example, struts2 example Today, I wrote a struts2 example to help you understand the basic process of struts2. In fact, the framework is not as difficult as you think. To put it bluntly, the essence of struts2 is a large Servlet, that

Thinking logic of computer programs (46) and thinking 46 The previous section introduces the basic concepts and algorithms of heap. In this section, we will discuss the specific implementation class PriorityQueue of heap in Java. Let's start with

Lucene (01), javase01 My blog address: http://www.cnblogs.com/tenglongwentian/ Lucene: the latest version is javase6.2.1, and the matching jdk version is the official version 1.8.The last jdk7 version is used here, So javase5.3.3 is used. Create a

Hibernate (8) _ cascade operations, struts + hibernate + Interface Programming architecture, hibernatestruts Cascade operations Cascade operations means that when you perform an operation on the primary object, hibernate automatically performs the