java 10th edition

Merge sort idea: Sort an array into two parts (using recursion), then merge the results together, merging the last two ordered arrays into a larger ordered array.Time complexity o (n) = NlognThe most appealing nature of merge sorting is that it guarantees that the time required to sort an array of any length n is proportional to the nlogn, and the disadvantage is that the extra space required is proportional to n.Merge sort is also divided into top-down sorting and bottom-up sorting methods:The

to add a carry, the result is a binary 10, the third step to add the results of the first two steps, the result is 10110, the conversion to decimal is just 22, this shows that the three-step strategy for the binary is also applicable.Next we will try to replace the binary addition with the bitwise operation. The first step does not consider the rounding to add to each bit. The result of 0+0,1+1 is that the result of 0,1+0 is 1. The result of 0+1 is 1, and we notice that this is the same as the

which point the last node in the list is 10. Then we go through the transformation of the right subtree, and link the root node with the smallest node in the right subtree. As to how to convert its Saozi right subtree, as the traversal and conversion process is the same, we naturally think of recursion.Java Code Implementation:/** * Enter a binary search tree to convert the two-fork search tree into a sorted doubly linked list. * requires that no new nodes can be created, only the point pointer

digit is 1 of the number such as the input 12345,1 appear in the 10000--12345, the number of occurrences is not 10000, but 2,346 times, That is, the number remaining after the highest digit is removed plus 1 (i.e. 2345+1= 2346)The next step is to analyze 1 of the four-bit numbers that appear outside the highest bit. For example, in the 20,000 digits of the 1346--21345, the number of 4 digits in the second 1 appears 2000 times. Since the highest bit is 2, we suspect that the number of the second

Down (LIFO) stack: an implementation that dynamically adjusts the size of the arrayImport Java.util.iterator;public class resizingarraystackAdvantages:Almost (but not useless) achieves the best performance for the implementation of any collection class data type:1. The time of each operation is independent of the collection size;2. Space requirements always do not exceed the set size multiplied by a constant.Disadvantages:Some push () and pop () operations adjust the size of the array, which is

10,5,7. Next we take the node with a value of 10 from the data container. Notice that the node value of 10 is 5, 7, the node is placed in the container first, and then the two nodes are removed first, this is what we usually say first in first out, so it is not difficult to see that this container should be a queue. Because nodes with a value of 5,7,9,11 have no child nodes, they can be printed in turn.By analyzing specific examples, we can find the rules for printing binary trees from top to b

, Calendar.january, 1, 0, 0, 0); Boom_end=Gmtcal.gettime (); } Public BooleanIsbabyboomer () {returnBirthdate.compareto (Boom_start) >= 0 Birthdate.compareto (boom_end) ; }}There ' s a new-to-create unnecessary objects in release 1.5.It was called Autoboxing,and It allows the programmer to mix Primitive and boxed primitive types,boxing and unboxing automatically as needed.Prefer Primitives to boxed Primitives,and watch out for unintentional autoboxing.Don ' t create a new object when you sh

Binary search tree: is a binary tree in which each node contains a key and a value associated with it, and each node has a key greater than the key of any node in its left subtree, which is less than the key of any node in its right sub-tree.The principle of each method of binary search tree is explained in detail in the code, the following is the code:/** * * @author seabear * Binary search tree * @param Copyright NOTICE: This article for Bo Master original article, without Bo Master permissio

)); } returnresultsb.tostring ();} /*** Converts a byte into a string of 16 binary form*/ Private StaticString bytetohexstring (byteb) {intn =b; if(N ) n= 256 +N; intD1 = n/16; intD2 = n 16; returnHEXDIGITS[D1] +HEXDIGITS[D2];} Public Static voidMain (string[] args) {String password= Password.createpassword ("Huangcheng"); System.out.println ("String for Huangcheng with MD5 digest:" +password); String inputstring= "Huangchenghuangcheng"; System.out.println ("Does the Huangchenghuangcheng match

+ * Reacquire the lock before - */ + Public voidsleep () { ALib.asserttrue (Conditionlock.isheldbycurrentthread ());//determine the current process held the Block at BooleanIntstatus =machine.interrupt (). disable (); - Waitedthreads.add (Kthread.currentthread ()); - conditionlock.release (); - kthread.sleep (); - Conditionlock.acquire (); - machine.interrupt (). Restore (intstatus); in } - to /** + * Wake up at the most one thread sleeping on this condition variable

; } PublicBuilder Calories (intcalories) { This. Calories =calories; return This; } PublicBuilder Fat (intfat) { This. Fat =fat; return This; } PublicBuilder Sodium (intsodium) { This. sodium =sodium; return This; } PublicBuilder Carbohydrate (intcarbohydrate) { This. Carbohydrate =carbohydrate; return This; } PublicNutritionfactsbuilder Build () {return NewNutritionfactsbuilder ( This); } } Private

Day01Win 7 system Open Dos Interesting method: Press and hold shift+ right, click "Open Command Window Here" (Note: Here can be any folder, not necessarily the desktop)Files deleted with DOS can not be recovered at Recycle Bin.!!Common DOS commandsD: Enter drive letter ToggleDir (directory): Lists the files and folders in the current directoryMD (Make directory): Create directory (create folder)RD (remove directory): Delete directory (delete folder, note: If the folder must be empty!!) ）If you w

Select the sort step:1. Locate the subscript of the smallest element in the array that participates in the traversal comparison;2. Swap the minimum element with the first element in the array that participates in the traversal comparison (if the first element is the smallest element, it will also be exchanged);3. If there are elements in the array that need to participate in the traversal comparison, jump to step 1, otherwise the sort ends.All of the sorts given in the fourth version of the algo

Action Radio box, check boxHTML>Body> form> inputtype= "checkbox"name= "Fruit"value= "Berry"/>Strawberryinput> BR/> inputtype= "checkbox"name= "Fruit"value= "Watermelon"/>Watermeloninput> BR/> inputtype= "checkbox"name= "Fruit"value= "Orange"/>Orangeinput> form>Body>HTML>Webelement radiooption=driver.findelement (By.xpath ("//input[@value = ' berry ']"); if (! radiooption.isselected ()) { ra

"); //Droplist.selectbyindex (3). GetText () method error, accounting for what reason, are quoted Droplist.getfirstselectedoption (). GetText () to assert//assert.assertequals ("Hawthorn", Droplist.selectbyindex (3). GetText ()); //selected by option text, Droplist.selectbyvisibletext ("Lychee"). GetText () error;//assert.assertequals ("Litchi", Droplist.selectbyvisibletext ("Litchi"). GetText ());ListNewstring[]{"Peach", "Hawthorn", "lychee", "Orange"})); ListNewArraylist(); //droplist.getoptio

, allowing you to precisely control where each element in the list is inserted or removed. The user can access the element based on the integer index of the element (where it is located in the list) and search for the elements in the list.List interface in iterator,add,remove,equals , and hashcode The contract for the method is added with some additional conventions that exceed the conventions specified in the Collection interface. The list interface provides a way to locate (index) access to th

2016 doomed to be a year of change, busy, net red, project financing failure, now a bit of time full post ~ ~Goal:Improve work efficiency and quality, can support the platform full-scale interface regression testing and iterative testing to meet the single interface test.People used:testing, developmentToolkit Catalog:Use:1. Fill in the test case2. Modify the execution configuration file3. Executing the JAR classTool Advanced:Rough version: The implementation of cryptographic decryption package,

that the first click does not reach the mine, we initialize the map in the mousepressed (MouseEvent e) method, putting the current mouseThe location of the click is set to mine, and the current position is restored by default when the mine is randomly initially completed2. This should be the hardest thing to do. Of course, if you've learned the search in algorithms, it's so easy.Both DFS and BFS are OK. From the current position, deep search in its eight directions until it encounters a number

Public classLX { Public Static voidMain (string[] args) {int[] c=New int[20] [20]; intI,j,k=1; for(i=0;i) { for(j=i;j) {C[i][j]=k++; } for(j=i+1;j) {c[j][7-i-1]=k++; } for(j=7-2-i;j>=0;j--) {c[7-i-1][j]=k++; } for(j=7-2-i;j>i;j--) {C[j][i]=k++; } } for(i=0;i) { for(j=0;j) {System.out.print ("\ T" +c[i][j]+ ""); } System.out.println (); } }}Spiral Matrix (Java