sid number lookup

Topic:To count the number of occurrences of a number in a sorted array, such as the sort array {1,2,3,3,3,4,5}, the number 3 appears is 3. Ideas for solving problems:1. First of all, traversing an array is sure to know the number of a number, at this time the complexity O (n

public class Employeedemo {//Method one: public int search (string str,string strres) {//lookup string in the same number as the specified string int n=0;//counter//for (int i = 0;i　　The same number in the Java lookup string as the specified string

in the arrayTwo clear:return value type: intParameter list: int[] arr,int value*/ Public Static intGetIndex (int[] arr,intvalue) { //iterate through the array, get each element in the array, and compare the known data for(intx=0; x) { if(Arr[x] = =value) { //returns the current index value if it is equal. returnx; } } //The current code has a small problem//That is, if the data I am looking for does not exist in

For example, to find the AAA string in the ABC catalogue. Grep-rn "AAA"/wwwroot/abc/the current directory. -R indicates recursive lookup-n for displaying line numbers VI How the open document displays line numbers Set:number Do not show line numbers Set:nonumber Jumps to a specified number of lines, such as 100 lines Enter 100G carriage return Example Find "hello,world!" String, you can do this:

Find Clevercode in the current directory and subdirectories, all PHP occurrences are greater than 0 times.# find-type f-name ' *.php ' | Xargs grep clevercode./*.php-rc | Awk-f ': ' $ > 0 {print $1,$2} ' | Grep-v '/.svn/' | Sort-n-K 2-r1) find-type f-name ' *.php '. Finds all PHP files in the current directory and subdirectories.2) xargs grep clevercode./*.php-rc. Finds the Clevercode keyword in each file and displays the number of occurrences.3) awk-

1. Using the IndexOf method: public class Test11 { private static int counter = 0; /** * @param args * /public static void main (string[] args) { String str = "Sdss**hgjhadhcasch ^^ "; int i = stringnumbers (str); System.out.println (i); } public static int stringnumbers (String str) { if (str.indexof ("Java") ==-1) {return 0; } else if (Str.indexof ("Java")!=-1) { counter++; Stringnumbers (Str.substring (Str.indexof ("Java") +4)); return counter

Find Clevercode in the current directory and subdirectories, all PHP occurrences are greater than 0 times.# find-type f-name ' *.php ' | Xargs grep clevercode./*.php-rc | Awk-f ': ' $ > 0 {print $1,$2} ' | Grep-v '/.svn/' | Sort-n-K 2-r1) find-type f-name ' *.php '. Finds all PHP files in the current directory and subdirectories.2) xargs grep clevercode./*.php-rc. Finds the Clevercode keyword in each file and displays the number of occurrences.3) awk-

Example one, find Java type file Packagefile;ImportJava.io.File; Public classJava { Public Static intnum = 0; Public Static voidMain (string[] args) {//TODO auto-generated Method StubFile File =NewFile ("F:\\crt"); Show (file); System.out.println ("+num+" with "Jar file"); } Public Static voidShow (file file) {//TODO auto-generated Method Stub for(File f:file.listfiles ()) {if(F.isfile ()) {if(F.getname (). EndsWith (". dll") ) {num++; } }Else{show (f); }

ImportJava.util.*; Public classSame { Public BooleanChecksam (String Stringa, String stringb) {//Write code here int[] str1=New int[256]; int[] str2=New int[256]; if(Stringa.length ()! =stringb.length ()) { return false; } for(intI=0;i) {Str1[stringa.charat (i)]++; Str2[stringb.charat (i)]++; } for(intj=0;j){ if(str1[j]!=Str2[j]) { return false; } } return true; }}Note the points:1. You can use ToCharArray () and Str.chara

For monitoring needs, you must call MongoDB's PID,Method 1:Add in the interactive file, pidfilepath=/var/run/mongodb.pid, restart MongoDB,Note that 2.5.3 below the version, the PID file is not found, this is a bug, in 2.5.3 or more versions before repair;Method 2: write the script to get it: the main content of the scriptPid= ' PS aux|grep mongodb |awk ' {print $} ' |sed-n ' 1p 'Method 3: inadvertently go to the data directory of MongoDB, found a mongod.lock, the inside record is PIDThen make a

quicksearch function that has the largest number of K before it is quickly found.finding the number of K-large based on the idea of fast sortingfunctionQuickSearch (a,left,right,k) {if(kreturn-1;//Focus 1, when the value of K does not meet the requirements, return-1 if(Left==right)returnA[left];//Focus 2, the end condition of the recursionLet Key=-1,len=0; if(leftRight ) {Key=partition (A,left,right); L