trie data structure java

reviewed the classmates blog and code This week's study of the knot 20172325 The contents of chapters 11th and 12th are studied together. Other这两章是在老师讲了之后我才去看的。基本是看得懂的。但是老师说对于IO异常这个方面，更需要了解的是如何利用流进行读写文件等。这个方面我觉得我还不是很会，所以之后还会继续学习这个。而十二章，我觉得对于我来说，重点就是要了解它每一步的操作，因为我觉得书中的递归的代码写的十分的缜密，这个方面我也不擅长，就在编写后面的题时就可能想少东西，导致结果有问题。还需要学习。Learning progress Bar lines of code (new/cumulative) Blog Volume (Add/accumulate) Learn

if(Head.next.data.equals (key)) { theSystem.out.print ("Query node:" + key + ","); theSystem.out.print ("Query node predecessor node is:" + Head.data + ","); the if(Head.next.next! =NULL) {98SYSTEM.OUT.PRINTLN ("Query node post node is:" +head.next.next.data); About}Else { -SYSTEM.OUT.PRINTLN ("Query node is tail node!"));101 }102 return;103 }104Head =Head.next; the }106System.out.println ("No this node!"));107

algorithm, O (n) - Public intLength () { to inti = 0; + for(Node This. Head.next; P! = This. Head; p =p.next) -i++; the returni; * } $ Panax Notoginseng //returns the element I (≥0) and returns NULL,O (n) if i - PublicT Get (inti) { the if(I >= 0) { +Node This. Head.next; A for(intj = 0; P! = This. Head J ) thep =P.next; + if(P! = This. Head) - returnP.data;//p points to the first node $ } $

Java Data Structure-linked list (1): Single-Chain tables and related common operations Package LinkList; public class Node {Public T data; // data domain public Node next; // Node domain // default constructor public Node () {}// constructor with parameters, public Node

of the second order is: 305 421 124 430 532 35 240And then sort the numbers on the hundreds:The result of the third Order is: 35 124 240 305 421 430 532Finally, our results are: 35 124 240 305 421 430 532At this point, the sorting of the arrays has been completedAttached Source: Public classRadixsort {@Test Public voidFun () {int[] n = {421, 240, 35, 532, 305, 430, 124}; Radixsort (n); for(inti:n) {System.out.print (i+ " "); } } //implement Cardinal sort lsd-from lowest bit start

, "E")};int[][] bestvalues = new int[pg.length+1][packagewheight+1];for (int i=0;iinterested students can go to my github to clone this project: Https://github.com/jimenbian/DynamicProgramereference: "1" http://blog.csdn.net/mu399/article/details/7722810"2" http://www.cnblogs.com/SDJL/archive/2008/08/22/1274312.html "3" http://blog.163.com/guixl_001/blog/static/41764104200863015855721//********************************* This article from the blog "Bo Li Garvin"* Reprint Please indicate the

//sum -T.A[K] = A[k] +B.a[k];Wuyi } the } - returnT; Wu } - About //Print the symmetric matrix, this is the key!! $ Public voidprint () { - intK; - for(inti = 1; I ) { - for(intj = 1; J ) { A if(I >=j) { +K = i * (i-1)/2 + j-1; the}Else { -K = J * (j-1)/2 + i-1; $ } theSystem.out.print ("" +a[k]); the } the System.out.println (); the } - } in the}1 P

Import Java.lang.reflect.Array;/*The specific principle in the C + + version has been said very clearly, here no longer repeat,Just a point: Java generics have a boundary effect, and once the departure scope is immediately replaced with the object type, reflection is required in the new generic array.*/Interface basestackBoolean push (T x);Boolean pop ();void Clear ();Ttop ();}public class JbstackT[] Mstack;int mmaxsize,mindex;static public void Main

str) {super . Append (str); return this ; }}2. What is StringBuffer?StringBuffer is a thread-safe variable String classJava.lang.StringBuffer inherits from Abstractstringbuilder (which is inherited from the class as well as StringBuilder, and some methods are implemented in that class), overriding most of its methods, without changing the logic to just change it to synchronized thread synchronization.Part StringBuffer Source: Public Final class stringbuffer extends abstractstringbuil

Java Data Structure series-tree (5): recursive and non-recursive implementations of post-sequential traversal of Binary Trees Package tree. binarytree; import java. util. stack; /*** recursive and non-Recursive Implementation of Binary Tree post-sequential traversal ** @ author wl **/public class BitreePostOrder {// Re

24 12 3 24 12 3 45 24 12 3 20 45 24 12 3 20 15 25 45 24 12 3 20 15 25 32 45 For the first time, take the first number 32,From right to left, until you find a number smaller than 32, take the

need to add another condition, that is, if the pointer is empty, then the problem is solved.By the way, paste the code for the improved ToString method:@Overridepublic String toString() { return "[" + this.NodesToString(this) + "]";}/** * @param foLinkedList * @TODO 设置单链表的长度 * @return 单链表的节点字符串序列 */private String NodesToString(FOLinkedList3. Two pointer traversal to determine if the steps are equalIdeas:?? Set two working hands P, Q,p always go forward, but Q every time to start from the be

Topofstack minus 1.These operations are performed not only with constants, but also in very fast constant time. On some machines, the push and pop of integers can be written as a machine instruction if they operate on registers with Self-increment and self-reducing addressing Functions. Modern computers use stack operations as part of the instruction system, so the stack is probably the most important data struct