effective java second edition

A Application Scenarios and CasesSome time ago 2048 compared to fire, so this case is the application of observer mode to complete the Java version of the 2048 game.Game preview: 2048 The game uses the arrow keys to move the block up or down. If two squares with the same number collide in the move, they are merged into a single block, and the number is changed to the sum of the two. Each time you move, a new block with a value of 2 or 4 appears. When

(DoublePDoubleNDoubleTotal ) { DoubleBase= (Double) ((total-p)/p)/N); System.out.println ("The rate of return for doubling the equity-type deposit by compounding is:" +base); } Private Static voidYanglaojin (DoubleIDoubleTotalDoubleN) {//n time I interest rate for(intj=1;j) {i= (1+n) *i; } Doublemoney=total/i; System.out.println ("Required Principal:" +Money ); } Private Static voidDanli (DoublePDoubleIDoubleN) {DoubleG; G=p+p*i*N; System.out.println ("Simple Interes

/** * Title: * There are a pair of rabbits, from the 3rd month after birth, each month has a pair of rabbits, the rabbit long to the third month after the birth of a pair of rabbits each month. * If the rabbit is not dead, ask after month months, how many rabbits total? */public class Fibonacci {//month static Integer month = 3;//NOTE: month > 0public static void Main (string[] args) {Integer pair = f (month); System.out.println ("A: after" + month + "months, the total number of rabbits is" + p

GitHub Address: Https://github.com/iamcarson/CarsonPARTNER: PenghongliangStudy No.: 201406114148Work with a partner handsome photo:Where to upgrade this time:1, improve the interface display, so that the overall interface looks more concise2, originally used StringBuffer to store the results and then displayed, after the upgrade using the database display3. Realized a function of emptyingThe effect is as follows:：This time using MVC mode, there are data layer, control layer, display layerSummary

unordered area directly to the end of the ordered area.Simple Selection Sorting Example:Given the array to be sorted a[0......5]={2,7,6,3,1,5}First trip: I=0, in the unordered area a[0......5], index=4, Element min a[0] and a[4] are exchanged. Get sequence: {1,7,6,3,2,5}Second trip: I=1, in the unordered area a[1......5], index=4, Element min a[1] and a[4] are exchanged. Get sequence: {1,2,6,3,7,5}Third trip: i=2, in the unordered area a[2......5], index=3, Element min a[2] and a[3] are exchang

")); Input.clear (); Input.sendkeys ("test engineer Specifies input"); Driver.findelement (By.id ("STB")). Click ();5, analog keyboard, mouse operation page@Test Public voidpage () {BASEURL= "Http://www.sogou.com"; Driver.navigate (). to (BASEURL); Webelement input=driver.findelement (by.id ("Query")); Input.sendkeys ("Selenium Webdriver API"); Actions Action=NewActions (driver); Action.contextclick (Input). perform ();//Mouse Right-clickAction.doubleclick (Input). perform ()

sorted.1 Public int[] Chosesort (int[] intarr) { 2 for(inti=0;i){ 3 intLowindex =i; 4 5 for(intj=i+1;j){ 6 if(intarr[j]Intarr[lowindex]) { 7Lowindex =J; 8 } 9 } Ten One //swaps the current first element with the smallest element in the sequence that follows it, that is, placing the smallest element in the front-end A inttemp =Intarr[i]; -Intarr[i] =Intarr[lowindex]; -Intarr[lowindex] =temp; the } - - ret

*@throwsException*/ Public StaticString decode (file file)throwsException {bufferedimage image; Image=imageio.read (file); if(Image = =NULL) { return NULL; } Bufferedimageluminancesource Source=NewBufferedimageluminancesource (image); Binarybitmap Bitmap=NewBinarybitmap (NewHybridbinarizer (source)); result result; Hashtable hints=NewHashtable (); Hints.put (Decodehinttype.character_set, CHARSET); Result=NewMultiformatreader (). Decode (bitmap, hints); Strin

Exercise 3:Public class maintest {public static void Main (String args[]) { Bcycle b=new Bcycle (); B.print (); } /** * Output: *--bcycle------- *----PRINT-----* */public static void P (String str) {};} Abstract class Cycle{public abstract void Print ();} Class Bcycle extends Cycle{private int i=47;public Bcycle () {System.out.println ("--bcycle-------" +i);} @Overridepublic void print () {System.out.println ("----print-----" +i);}}

=ptr1; +Pre =ptr1; -PTR1 =Ptr1.next; the}Else{ *Pre.next =ptr2; $Pre =ptr2;Panax NotoginsengPTR2 =Ptr2.next; - } the } + while(Ptr1! =NULL){ APre.next =ptr1; thePre =ptr1; +PTR1 =Ptr1.next; - } $ $ while(PTR2! =NULL){ -Pre.next =ptr2; -Pre =ptr2; thePTR2 =Ptr2.next; - }Wuyi the - returnHeader.next; Wu -}The list implementation of bubble sortalgorithm idea: compare adjacent nodes sequentially, and e

) {//stringbuilder str = new StringBuilder ("We are happy."); LongTimelast = System.currenttimemillis (); String str ="We are happy."; Spacereplace (str, -);//we%20are%20happy. LongTimeafter = System.currenttimemillis (); System. out. println (Timeafter-timelast); }}Solution Three：the JDK's own string segmentationCode implementation:Packagestring; Public classSpacestringreplace { Public StaticStringSpacereplace(String strold) {string[] split = Strold.split (" "); StringBuilder Stri