java 10th edition

. Through the synchronous lock, it realizes the mutually exclusive access to "cruelty". for the production method produce () : When the warehouse is full, the producer thread waits and waits for the consumer to consume the product before the production line can be produced; After the producer thread has finished producing the product, all threads that synchronize the lock are awakened through Notifyall (), including " Consumer thread ", what we call" informing consumers of consumption ". for co

pair. Each time we compare, we copy the larger numbers from the back to the secondary array, making sure the numbers in the auxiliary array are ascending. After copying the larger number to the array, move the corresponding pointer forward one bit, then proceed to the next round of comparisons.After the detailed discussion above, we suspect summed up the process of statistical reverse order: First, the array is separated into sub-arrays, the number of reverse pairs in the sub-array is counted,

Java code to implement:/** * Enter an array of integers with positive and negative numbers in the array. One or more consecutive integers in an array make up a sub-array. * The maximum value of all sub-arrays is evaluated. Requires time complexity O (n) */package swordforoffer;/** * @author Jinshuangqi * * August 8, 2015 */public class E31greatestsumofsubarrays {Pub Lic Integer findgreatestsum (int[] arr) {if (arr.length ==0) return null; int greate

it.Analysis here, we can see that this is actually a very typical recursive thinking, so we write the following Java code:/** * Enter a string to print out all the permutations of the string. * For example, enter the string ABC, print out all the strings that can be arranged by the character A,b,c ABC,ACB,BAC,BCA,CAB,CBA */package swordforoffer;/** * @author Jinshuangqi * * August 7, 2015 */public class E28stringpermutation {public void swap (char[]

pointer is introduced, so we have to deal with the empty list separately. When the first linked list is an empty list, that is, its head node is a null pointer, then it is merged with the second linked list, and the process of the idler merge is the second linked list. Similarly, when the head node of the second linked list is a null pointer, we combine it with the first linked list to get the first linked list. If two linked lists are empty lists, the result of merging is to get an empty list.

numbers are pressed into the stack and the next number is not found, then the sequence cannot be a pop-up sequence.After the formation of clear ideas, we can have some code, the following is the implementation of Java code./** * Enter a sequence of two integers, the first sequence represents the stack's indentation order, and determine if the second sequence is the pop-up order for the stack. */package swordforoffer;import java.util.stack;/** * @auth

people met in the number 2, the benchmark number 3 and this 2 exchange, get a new array 2 1 0 3 7 9 3 5, the 3 as a split point, the entire array is divided into two parts, the left 2 1 0 and the right 7 9 3 Repeat the above steps to continue sortingThe Java code is as follows: Public classQuickSort { Public Static voidMain (string[] args) {//TODO auto-generated Method StubQuickSort QS=NewQuickSort (); int[] score = {10,9,8,7,6,5,4,3,2,1}; Qs.quickso

[] 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 ();}}

Thinking in Java 4th Edition source codeinstructions for downloading, installing and testing the source code Download The source code zip file from this link. Create a directory in which to install the code. For these instructions, we'll refer to the This directory as C:\TIJ4\code. Using Winzip or some other zip utility, extract the zip file into the C:\TIJ4\code directory. When you ' re done, you s

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