java edition

add what subagent is all custom.Poke me DownloadNote that this down is not directly used, because my ID has a daily identification limit, so you want to change the res/value/strings in the app_id to your own Iflytek Id,jar package also to be replaced by your own, detailed procedures to participate in the front from the 0 series blog.The graduation design can finally be finished.。。Give me great help. Site Address: Http://wiki.speech.cs.cmu.edu/olympus/index.php/OlympusThere are no matter what qu

Title: Vampire numbers are numbers with an even number of digits that can be multiplied by a pair of numbers, which each contain a number of half-digits of the product, where the number selected from the initial number can be arbitrarily sorted. Numbers ending in two 0 are not allowed, for example, the following numbers are "vampire" numbers:1260=21*601827=21*872187=27*81Write a program to find out 4-digit numbers of all vampires./** * 　　Java Programm

its elements can be accessed efficiently and randomly, and the disadvantage is that the performance of inserting and removing elements at a specified location is slow. LinkedList is slower in random access, but it is more efficient to insert and remove elements at a specified location. 2. Set has three important implementations, respectively, Hashset,treeset,linkedhashset all implementation classes of the set interface ensure that their elements are not duplicat

v3 */ Public Static voidDfstraverse (Graph g) {inti; //Initialize the Access ID, all vertices are not accessed for(i=0; i) {Visited[i]=false; } for(i=0; i) { //① if(!Visited[i]) { //② DFS (g,i); } } } Public Static voidMain (string[] args) {Graph g=NewGraph (); Createmgraph (g);//Create DiagramPrintgraph (g);//Vertex and adjacency matrices for input graphsDfstraverse (g);//Depth-first traversal diagram }

;ImportOrg.testng.annotations.BeforeMethod;Importorg.openqa.selenium.By;ImportOrg.openqa.selenium.JavascriptExecutor;ImportOrg.openqa.selenium.WebDriver;Importorg.openqa.selenium.WebElement;ImportOrg.openqa.selenium.chrome.ChromeDriver;ImportOrg.testng.annotations.AfterMethod; Public classScrollbarapi {webdriver driver; String BaseUrl; //Slide the scroll bar to the bottom of the page@Test (priority=0) Public voidf () {((javascriptexecutor) driver). Executescript ("Window.scrollto (0,documen

("**************** test Case execution End ****************"); Log.info ("-------------------------------------------"); } Public Static voidinfo (String message) {log.info (message); } Public Static voidwarn (String message) {log.info (message); } Public Static voiderror (String message) {log.info (message); } Public Static voidFatal (String message) {log.info (message); } Public Static voidDebug (String message) {log.info (message); }}3. Write test Class Code PackageChina

) theLength[i] =Qarray.get (i). Size (); - for(inti = 0; i ) { -queueQarray.get (i); the while(length[i]--> 0) { theString str =Q.poll (); theQarray.get (Alphaindex (Str.charat (j-1)) . Offer (str); the } - } the } the for(inti = 0, aindex = 0; i //finally the while(Qarray.get (i). Size () > 0)94s[aindex++] =Qarray.get (i). Poll (); the } the the Private intAlphaindex (Charc) {98 returnAlpha

Import java.util.*;public class Exercise13_04 {public static void Main (string[] args) {Scanner input = new Scanner (system.in);System.out.println ("Enter month and Year:");Printcalendar Y = new Printcalendar (Input.nextint (), Input.nextint ());Y.printmonthtitle (); Y.printmonthbody ();}}Class Printcalendar {Calendar value;Public Printcalendar (int Month, int.) {value = new GregorianCalendar (year, Month, 1); }public void Printmonthtitle () {System.out.println ("" + Getmonthname (Value.get (cal

(head.next==rear) {int data=rear.data;head.next=null;rear=head;length--; Return data;}int data=head.next.data;head.next=head.next.next;length--;Return data;}int Removelast ()//tail Delete{node N=head;int data=rear.data;While (n!=null) {If (n.next.equals (rear)){n.next=null;rear=n;}n=n.next;}length--;Return data;}int Removeafter (node N)//post-delete{if (n.next==null) return 0;Node N1=n.next;int data=n1.data;If (n1.next==null) {N.next =null;rear=n;}n.next=n1.next;length--;Return data;}int Remove

, byte[] salt, int iterationcount, int keySize) throws Generalsecu rityexception {try {pbekeyspec spec = new Pbekeyspec (password, salt, IterationCount, keySize); Secretkeyfactory factory = secretkeyfactory.getinstance (algorithm); return Factory.generatesecret (spec). getencoded (); } catch (IllegalArgumentException e) {throw new Generalsecurityexception ("Key size" + KeySize, E); }}public Static Boolean matches (char[] password, byte[] passwordhash, byte[] salt) throws Gen

Sword refers to Offer interview question 10 (Java edition): number of 1 in binary, and sword refers to offer Question: Please implement a function, input an integer, and output this number in binary format to represent the number of 1. For example, if 9 is expressed as binary 1001, two digits are 1. Therefore, if 9 is input, this function outputs 2. 1. solutions that may cause an endless loop This is a basi

Sword refers to offer interview question 14 (Java edition): Adjust the array order so that the odd number is in front of the even number, the sword refers to offer Question: enter an integer array and implement a function to adjust the order of numbers in the array so that all odd numbers are in the first half of the array, and all even numbers are in the second half of the array. 1. Basic implementation: I

Quick sorting and optimization (Java Edition) Quicksort is an improvement in Bubble sorting. Quick sorting was proposed by C. A. R. Hoare in 1962. Detailed process of a quick sort:Select the first value of the array as the pivot value. Code implementation: Package QuickSort; public class QuickSortRealize {public static void QuickSort (int [] arr) {QSort (arr, 0, arr. length-1);} // sort the subsequences of

Common linked list questions (java Edition) Dry goods directly ..... Common linked list questions:Find the last k nodes of a single-chain table. Delete a node (O (1) in a single-chain table )). Reverse the linked list. The first public node of the two linked lists. The Start Node of the loop returned from the chain table (and whether the ring exists ). Merge two sorted linked lists. Delete duplicate nodes i

*@return */ Public Static Booleangenerateimage (String imgstr,string imgpath,httpservletrequest request) {//get the path where the physical path WebAppString pathroot = Request.getsession (). Getservletcontext (). Getrealpath (""); //Base64 decoding a byte array string and generating a picture if(Imgstr = =NULL) return false; Base64decoder Decoder=NewBase64decoder (); Try { //Base64 decoding byte[] B =Decoder.decodebuffer (IMGSTR); for(inti = 0;

I. Where the object is saved Register (CPU) Stack (variable) Heap (object) Static domain (statics) Chang (String) Non-memory Zone pool Two. Basic data typesInteger byte short int long 8 16 32 64Float type float Double 32 64Character Char-UnicodeBoolean Type Boolean 1Three. Static belongs to a class call that does not belong to an object (many in a generic tool class)Thinking in Java (fourth