java data structures video tutorials

cardsLookpoker ("Wind Qing", Fengqingyang);Lookpoker ("Brigitte", Linqingxia);Lookpoker ("Elina", Liuyi);Lookpoker ("Hole cards", Dipai);}public static void Lookpoker (String name, arraylistSystem.out.print (name + "The card is:");for (String S:array) {System.out.print (S + "");}System.out.println ();}}Test multiple timesOutput:The wind is the card is: Xiao Wang 8 5 Q 4 7 8 9 A 4 7 2 6 7 8 9Brigitte's cards are: Q 5 9 A 6 3 Q 7 K K K 3 10 8 6 5Elina's cards are: 2 3 A J Q J 4 K 4 6 5 J 3 2 King

1 and 0 occurrences of the place, 1 and 0 appear two times, since there is no 0, then 1 is occupy the first and second position (please read this sentence carefully, this sentence read, the whole algorithm understand). Then we put one of the 1 in the position of the second position of the 1 b[1], while c[1]-1, because we have already lined up a 1.Next, I=1,a[1]=2,c[2] is less than or equal to 2 of the number of occurrences, c[2]=4, then to rank it in fourth place, that is b[3] position, while c

() method in the Bubblesort.java program (listing 3.1) with the Oddevensort () method . Make sure it runs in a sort of different amount of data, and that you need to figure out the number of two scans. Parity Ordering is actually useful in multiprocessor environments where the processor can process each odd pair at the same time, and then handle even pairs at the same time. Because the odd pairs are independent of each other, each pair can be compar

Maturelist maturelist=NewMaturelist (10);140/**141 * Add 5 Elements 142*/143 Maturelist.add ("Mature1");144 Maturelist.add ("Mature2");145 Maturelist.add ("Mature3");146 Maturelist.add ("Mature4");147 Maturelist.add ("Mature5");148 System.out.println ("Number of elements:" +maturelist.size);149 System.out.println ("element 1:" +maturelist.get (1));System.out.println ("Element 2:" +maturelist.get (2));151 System.out.println ("element 3:" +maturelist.get (3));System.out.println ("delete element 3

In actual programming, we often need to temporarily store data to implement a specific function. In pure C language, we need to implement a data structure (such as a linked list or Queue) to access elements, which is not only tedious, and the efficiency is not high (the encapsulation of the data structure by the class library is often optimized and has good perfo

of red-Haishi. But they can't all be full, so the height of the 2-3-4 tree is roughly log2 (n+1) and log2 (n+1)/2. Reducing the height of the 2-3-4 tree makes it shorter to find than red-Haishi.On the other hand, each node has more data items to view, which increases the lookup time. Because a linear search is used in a node to view data items, the multiple of the lookup time is proportional to M, which is

Recently listening to colleagues said that the use of Sparsearray instead of HashMap can improve performance, so the edge of the two classes of data structure for a simple analysis.Data structure of HashMapHashMap is a combination of arrays and linked lists (in the data structure called "chain-Table hashing"), as shown in:Photo Source: Java's HashMap and HashtableData structure of SparsearraySparsearray ref

Method Public BooleanDeleteLongvalue) { intj =find (value); if(j==Nelems) { return false; } Else { for(intK=j; k) {A[k]= A[k+1]; } nelems--; return true; } } //Binary Method Search Public intFindLongSearchkey) { intlowerbound = 0; intUpperbound = nElems-1; intCurin; while(true) {Curin= (lowerbound + upperbound)/2; if(a[curin]==Searchkey) { returnCurin;//found it } Else if

)? {???????? This.ddata?=?ddata;???????? This.idata?=?idata,????}???? Public?void?displaylink ()? {???????? System.out.println ("{"? +?idata?+? ",?"?) +?ddata?+ "}");????}}Simple test Cases:Package?com.xingej.algorithm.datastructure.linkedlist.singlelinkedlist;import?org.junit.test;/**?*? single-linked list test? *[email protected]?erjun?2017 December 8? Morning 9:00:54?*/public?class? Linklisttest? {[email protected]???? Public?void?test ()? {???????? Linklist?list?=?new? Linklist ();???????? ?

always increased. D. Sometimes the insertion time is reduced. Solution: Repeat may complicate the search algorithm: even if the last data item is matched, it must continue searching for possible matches until the last data item. 4. Random: When you look for a data item not in the array from an unordered array, it is usually faster than finding a

=currentlink.next;} System.out.println (""); System.out.print ("Linklist.displaylist () Finish");}}public class Linklistapp {public static void main (string[] args) {linklist thelinklist =new linklist (); Thelinklist.insertlink (9, 999, 999.999); Thelinklist.displaylist (); Thelinklist.insertfirst (22, 22.22); Thelinklist.insertfirst (33.33), Thelinklist.insertfirst (44.44), Thelinklist.insertfirst (55, 55.55); Thelinklist.displaylist (); Thelinklist.insertlink (2, 333, 333.333); Thelinklist.di

Set is a required question in the Java interview. However, in my interview experience, it is difficult to get a satisfactory response. Most of them can only understand the general usage method, but do not know about its internal structure. Incorrect usage will cause a significant reduction in performance. First, we will introduce ArrayList. As the name suggests, the internal data structure is an array of

); Linkedlist.removefirst (); Linkedlist.removelast (); //determine if the linked list is emptySystem.out.println (Linkedlist.isempty ());} HashMap Non-synchronous Public Static voidhashmaptest () {HashMapNewHashmap(); //adding elements to the hash tableHashmap.put ("TP", 123); Hashmap.put ("ZP", 567); System.out.println (HASHMAP); //facilitates a hash table with iterators for(IteratorHashmap.entryset (). iterator (); Iterator.hasnext ();) {EntryIterator.next (); Syst

));}} //Look at cardsLookpoker ("Wind Qing", Fengqingyang);Lookpoker ("Brigitte", Linqingxia);Lookpoker ("Elina", Liuyi); lookpoker ("hole cards", Dipai);}public static void Lookpoker (String name, arraylistSystem.out.print (name + "The card is:");for (String S:array) {System.out.print (S + "");}System.out.println ();}} Test multiple timesOutput: The wind of the card is: Xiao Wang ♦8♥10♦5♣q♥4♣7♣8♠9♦a♠4♥7♠2♦6♠7♥8♣9Brigitte's cards are: ♦q♥5♥9♠a♠6♣3♠q♦7♦10♠k♦k♣k♥3♠10♠8♥6♠5Elina's cards are: ♥2♠3♥

(Array.get (x)); } NBSP;NBSP;} Look at the cardsLookpoker ("Wind Qing", Fengqingyang);Lookpoker ("Brigitte", Linqingxia);Lookpoker ("Elina", Liuyi); lookpoker ("hole cards", Dipai);}public static void Lookpoker (String name, arraylistSystem.out.print (name + "The card is:");for (String S:array) {System.out.print (S + "");}System.out.println ();}} Test multiple timesOutput: The wind is the card is: Xiao Wang 8? 10? 5? Q. 4? 7? 8? 9? A 4? 7 2? 6? 7? 8? 9Brigitte's cards are:? Q. 5? 9? A? 6? 3?

the left to find an element that is larger than the base element, stop, the two elements are exchanged until two pointers meet, the end of the cycle * pointer point to the The position is where the datum element should be located in the collection * eg * {8,-2, 3, 9, 0, 1, 7, 6} * Benchmark * First bm=8 * end = Lengt h-1 = 7 * start=0 * End--, We found 6:8 small, end pointer stopped, current index is j=7 * start++, until element 9 stops, current index i=3 * Exchange the elements corresp

arranged in order. Delete them from the ordered table and add them to the array again. Then the order of the array will be sorted. This sorting method is more efficient than insert sorting in the array, because this method moves less times and the insert sorting in the array moves O (N * n). In this sort, you only need 2 * n copies. But there are also disadvantages, that is, to open up almost twice the space. Two-way linked list It provides the forward and backward traversal capabilities of the

-array with only one data item, and the other sub-array containing N-1 data items.A: in this case, the benefits of partitioning are gone, and the execution efficiency of the algorithm is reduced to O (N2). In addition to being slow, there is another potential problem, and when the number of partitions increases, the number of calls to the recursive method increases, and each method call increases the size o

Stack, Chinese translation for stacks, actually refers to the stack, heap, heap. This is about the stack of data structures, not the heap and stack inside the memory allocation.Stack is the structure of the advanced data, like your plate one by one pile up, the last one is stacked on the top.Queue is to buy apples in line, the first one can buy first.Stackpublic

can put in *, in Put +, that is abc*+.A * (b+c) turn suffix:Read a, read *, later found (can not be placed *, (B+C * Priority High, read, followed by), can be changed to bc+, and a * together, that is abc+*.This is a queue, but the structure to use is the stack, because it comes in. The arithmetic here does not have to be pressed into the stack, directly output.a+b-c Turn suffix:Direct output A, read +, stack empty press into the stack, then output B, stack non-empty, pop +, read to-,+ priority