java data structures interview questions

1. What are the differences between the basic data types in Java and whether the string type is the basic data type. Six numeric types (four integers, two floating point types), one character type, and one boolean type. Pay attention to the value range of each type. Prevent programs from overflowing the range of this type. String is a class, not a basic

right) {//Why J plus a 1, and I do not add 1 because the following loop is judged to start with--j and ++i.// The base element is selected Array[left], that is, the first element, so Zoo starts from the second element to compare int i = left;int J = Right+1;int pivot = array[left];//pivot for the selected datum element (head element) int Si Ze = right-left + 1;if (size >= 3) {pivot = medianOf3 (array, left, right);//array range is greater than 3, the datum element selects an intermediate value.

(20); Thequeue.insert (30); Thequeue.insert (40); Thequeue.remove (); Thequeue.remove (); Thequeue.remove (); Thequeue.insert (50); Thequeue.insert (60); Thequeue.insert (70); Thequeue.insert (80); while(!Thequeue.isempty ()) { Longn =Thequeue.remove (); System.out.print (n); // Max, Max, Max.System.out.print (""); } System.out.println (""); Priorityq THEPQ=NewPRIORITYQ (5); Thepq.insert (30); Thepq.insert (50); Thepq.insert (10); Thepq.insert (40); Thepq.insert

Queues are FIFO.Implementing the queue code using the Java language:/* Queue */public class Queue {private int maxSize; Maximum Queue private long[] Quearray; Queue array private int front; Team head private int rear; Team tail private int nitems; Number of current queue elements//constructor public queue (int s) {super (); this.maxsize = S;this.quearray = new Long[maxsize];this.front = 0;this.rear = -1;t

Vector implements a dynamic array. is an array of objects that can be automatically grown.Comparison of vectors and ArrayList:1, all in an array format to store data, index data block insert data slow2, ArrayList will be faster than vector, he is non-synchronous3, involving multi-threading, vector is a better synchronizationUsage:1. Constructor:1) Construction me

Analysis of common JAVA data structures and principles Not long ago, the interviewer asked me to explain how to understand the java data structure framework. I have also read some of the source code before. balabala has talked about a bunch of ideas and I will summarize them

mapping of key-value pairs, the relationship belongs to the inner object in the collection, which has direct access to the elements in the collection. In practical applications I think more of the nesting of maps.The tool class (collections, Arrays) Collections Collection Tool class is an operation combined with a specialized tool class which is defined by a static method, A variety of sorting binary lookups for the list collection (analogy string operations) can also turn threads unsafe into t

. 64. What are the similarities and differences between JSP and Servlet, and what are their relationships? JSP is an extension of Servlet technology. It is essentially a simple Servlet method, with more emphasis on the external expression of the application. After JSP compilation, it is "servlet-like ". The main difference between Servlet and JSP is that the application logic of Servlet is in the Java file and is completely separated from the HTML in

: a container for data storage, an array, or a linked list; a pointer; Other API behaviors are all around the container ** The main composition of a queue: a container for data storage, an array of arrays, or a list of two pointers. ** is not suitable for large amounts of storage, just a means of implementing some sort of algorithm.,** Restricted access Mode **@ authorerjun2017 December 6 Morning 9:11:40*/

Array Advantages: Fast query, if you know the index can quickly access the disadvantage: Delete slow, size fixed ordered array advantages: Faster than unordered array lookup disadvantage: Delete and insert slow, size fixed stack advantages: Provide last-in-first-out access method disadvantage: Access to other items is slow queue advantages: Provide first-in-out access method disadvantage: access to other The items are slow. List Advantages: Quick Insert, delete fast disadvantage: find slow (each

} + } - //complement the left and right sub-tree nodes of the two-fork tree the for(intj = 0; J ){ *Btn[j].setleftnode (btn[2*j + 1]); $Btn[j].setrightnode (Btn[2*j + 2]);Panax Notoginseng } - } the //Recursive method pre-order traversal + voidPreorder (Binarytreenode btn) { ABinarytreenode root =btn; the if(Root! =NULL){ + Printnode (root); - inorder (root.leftnode); $ inorder (root.rightnode); $ } - } - //recursi

Php Chinese network (www.php.cn) provides the most comprehensive basic tutorial on programming technology, introducing HTML, CSS, Javascript, Python, Java, Ruby, C, PHP, basic knowledge of MySQL and other programming languages. At the same time, this site also provides a large number of online instances, through which you can better learn programming... Reply: Programming languages are tools, such as hammers, axes, screwdrivers... The

capacityincrement) Vector initial capacity is initialcapacity, increment is capacityincrement The smaller the vector increment set, the higher the utilization of the memory space, but the greater the number of memory allocations The larger the vector increment is set, the less memory allocation will be performed, but it is possible to generate memory waste Adding elements to a vector: the Add () method or the Insertelementat () method After inserting an element, the

methods of collection and traversal mode Collection:add () Remove () contains () iterator () size () Traversal: Enhanced for iterator |--listget () Traversal: normal For|--setmap:put () Remove () ContainsKey (), Containsvalue () KeySet () get () value () EntrySet () size () Traversal: Find values based on key values for key and value jobs: Any collection I've explained, I ask you to store what you are able to store. And, you have to be able to traverse it.4:arraylist,linkedlist,hashset,hashmap

//Delete a node in a binary sort tree the PublicBstree Deletebstree (Bstree bstree,intkey) { the if(Bstree = =NULL) { - return NULL; - } the the if(Bstree.data = =key) { the //first case: leaf node the if(Bstree.left = =NULL Bstree.right = =NULL) { -Bstree =NULL; the } the //second case: node has left dial hand nodes. the if(Bstree.left! =NULL Bstree.right = =NULL) {94Bstree =Bstree.left; t

1 PackageIYou.neugle.search;2 3 Public classHash_search {4 Private Static intm = 13;5 Private Static int[] hash =New int[m];6 Private Static int[] Array =New int[] {13, 25, 2, 60, 39, 52 };7 8 Public Static voidMain (string[] args) {9 Inserthash ();TenSYSTEM.OUT.PRINTLN ("Hash table is established as follows:"); OneSystem.out.print ("["); A for(inti = 0; i ) { - System.out.print (Hash[i]); - if(I! = hash.length-1) { theSystem.out.print (","); -

arraybub{[] (max) {=[max]= } (value) {[]=value++} () { (j=jBubblesort {(string[] args) {maxSize = Arraybub arr = Arraybub (maxSize) Arr.insert () Arr.insert () arr.inse RT () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.insert () Arr.display () Arr.bubblesort () Arr.display ()} () {}}First look at the above code, bubble sort core is: Bubblesort () method, for loop nesting, the outer layer of each row minus one,

public class Myarraylist　　Self-made data structures (containers)-java development with the most ArrayList and HashMap

GCD Greatest Common divisorMethod: Euclid Algorithm (Euclidean method),"Thought" recursionIdeasCode1 Public classMain {2 Public Static intgcdintPintq) {3 if(q = 0) {4 returnp;5 }6 intr = p%Q;7 returngcd (q, R);8 }9}LCM Least common multipleThe pursuit of convenient formula method to solve.IdeasCode1 Public classMain {2 Public Static intgcdintPintq) {3 if(q = 0) {4 returnp;5 }6 intr = p%Q;7 ret

only inherit one parent classPolymorphicFour, algorithm effectiveness analysis:4.1 Time Complexity: Https://baike.baidu.com/item/%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/1894057?fr=aladdin (Baidu Connection)　　F (N) =n! (factorial) n-times with a time complexity of n4.2 Space Complexity: Https://baike.baidu.com/item/%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/9664257?fr=aladdin (Baidu Connection)V. Abstract classTo include one or more abstract methods (without a method body): To implement