effective java third edition

[] Bubblesortresult =px. Bubblesort (score); for(inti=0;i) {System.out.print (Bubblesortresult[i]+" "); } } /** Bubble sort * @param score score (0-10 points) * @return return count array * Description: There are n number, two adjacent number comparison, if the previous number is smaller than the number of the subsequent exchange position, assuming that a minimum number is placed in the most Back to a trip, you need to compare 1~n-1, set the number of times I, each trip compared to 1~n

complexity O (1) */package swordforoffer;/** * @author Jinshuangqi * * August 10, 2015 */public class E40numbersappearo nce {public void findnumsappearonce (int[] arr) {if (arr = = null) return;int number = 0;for (int i:arr) Number^=i;int index = f INDFIRSTBITIS1 (number), int number1= 0,number2 = 0;for (int i:arr) {if (IsBit1 (I,index)) number1^=i;elsenumber2^=i;} System.out.println (NUMBER1); System.out.println (number2);} private int findFirstBitIs1 (int number) {int indexbit = 0;while ((num

Sword refers to Offer interview question 27 (Java edition): Binary Search Tree and two-way linked list, sword refers to offer Question: enter a binary search tree and convert it into a sorted two-way linked list. It is required that a new node cannot be created. You can only adjust the point of the node pointer in the tree. For example, in the binary search tree, the two-way linked list after the output con

of the list is the 1th node in the bottom. * For example, a list of 6 nodes. Starting from the beginning, their values are sequentially 1. 2. 3,4,5. 6. The 3rd node of the list is the node with a value of 4 */package swordforoffer;import utils. listnode;/** * @author Jinshuangqi * * August 1, 2015 */public class E15kthnodefromend {public ListNode findkthtotail (listnode Head,int k) {if (head = = NULL | | k Test example; function tests (the K-node is in the middle of the list, and the K-node is

down as a dot class can not look at. the Private Doublex; the Private Doubley; - PublicPoint (DoubleXDoubley) { in This. x =x; the This. y =y; the } About PublicPoint () { thex = 0.0; they = 0.0; the } + Public voidSetPoint (DoubleXDoubleY) { - This. x =X; the This. y =Y;Bayi } the Public DoubleGetX () { the returnx; - } - Public DoubleGetY () { the returny; the } the Public Static Dou

The Texas-web3j-solidity project is a Java version that uses the WEB3J package and the ETH network to interact with the applet.The following features are mainly implemented:1. Release of contract2. Initiating a transfer3. Inquire about transactions4. Call the Smart Contract methodThe Texas-web3j-solidity project has made the following functional modifications on the basis of the official examples:1. Add Texas contract for game recharge and withdrawal

OverviewIn distributed systems, there are scenarios that require the use of a globally unique ID, which can be used to prevent ID collisions using a 36-bit UUID, but the UUID has some drawbacks, first he is relatively long, and the UUID is generally unordered.There are times when we want to use a simple ID and want the ID to be generated in an orderly fashion.The snowflake of Twitter solved this demand, and initially Twitter migrated the storage system from MySQL to Cassandra, because Cassandra

:" + getthumbprint (cert));Conn.disconnect ();}private static String Getthumbprint (X509Certificate cert) throws Exception {MessageDigest MD = messagedigest.getinstance ("SHA-1");byte[] der = cert.getencoded ();Md.update (der);Byte[] Digest = Md.digest ();Return Bytestohexstring (Digest);}private static String bytestohexstring (byte[] src) {StringBuilder StringBuilder = new StringBuilder ("");if (src = = NULL | | src.length return null;}for (int i = 0; i int v = src[i] 0xFF;String HV = integer.

Create a class that contains an int field and a char field that are not initialized and print them out to verify that Java performs the default initialization.public class Domtest{int I;char c;public domtest () {System.out.println ("i=" +i+ "\nc=[" +c+ "]" + "\ n []");/** * Print result as follows I =0 c=[] []//only for comparison reference */}/** * @param args */public static void main (string[] args) {new domtest ();}}

Problem Solving Ideas:First, we choose to find the number of sub 7 as an example to step through the process of finding.We then select 9 in the upper-right corner of the array.Code implementation:Package array; Public classQuencyarray { Public StaticBooleanFindarray(int[] arr,intNumber) {introws = arr.length;intcolumns = arr[0].length; Boolean flag =false;if(arr!=NULL rows>0 columns>0){introw =0;intCol = columns-1; while(Row0){if(Arr[row][col]//Description of the number to be searched belowrow++

;ImportUtils.sortutils;/** * Recursive sort iterations * @author liguodong * */ Public class Demo03 { Public Static void MergeSort(int[] a) {int[] TR =New int[A.length];//For storing merge results intk=1;//Start, sub-sequence length is 1 while(k//Merge the previously unordered data 22 into the TRK =2*k;//Sub-sequence length doubledMergepass (TR, A, K, a.length);//To merge the ordered sequence of 22 merges in the TR into the array aK =2*k;//Sub-sequence length doubled} } Pu

of ~2NLGN and constant additional space. Often used in embedded systems or in low-cost mobile devices (systems with very tight space), but many applications of modern systems seldom use it, because it cannot take advantage of caching. Array elements are rarely compared with other adjacent elements, so the number of cache misses is much higher than the algorithm that most comparisons make between adjacent elements, such as quick sort, merge sort, or even hill sort. On the other hand, the heap-im

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

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