tenr

Insert Sort1insertion-SORT (A)2 forj←2To Length (A)3 DoKey←a[j]4? Insert A[j] into the sorted sequence a[1.. J-1]5i←j-16 whileI>0and a[i]>Key7 Doa[i+1]←a[i]8i←i-19a[i+1]←keyMerge sort1 MERGE (a,p,q,r)2n1←q-p+13n2←r-Q4Create Arrays L[1.. n1+1] and r[1.. n2+1]5 fori←1to N16 Dol[i]←a[p+i-1]7 forj←1To N28 Dor[j]←a[q+J]9l[n1+1]←∞Tenr[n2+1]←∞ Onei←1 Aj←1 - forK←p to R - Do ifl[i]R[j] the Then A[k]←l[i] -i←i+1 -

a. So the last time complexity is only O (n).#:15927417Author:_snakes_problem:625dLang:gnu c++11verdict:acceptedTime:31 msmemory:0 KbSent:2016-02-10 13:33:00Judged:2016-02-10 13:33:011#include 2 using namespacestd;3 intMain ()4 {5 Chars[100005];6 intN,l,r;7 while((scanf ("%c", s[++n]) = =1) (s[n]>='0') (s[n]'9'))8s[n]-='0';9L=1;Tenr=--N; One if(s[l]!=S[r]) A { -s[l]--; -s[l+1]+=Ten; the if(s[l]==0) -l++; - } -

Problem: Set N (n>1) integers to be stored in a one-dimensional array R. An algorithm is designed to move the sequence in R to the left P (0Analysis:The subject is not difficult, to achieve r in the sequence of the left shift p position, only the first P elements in the R in the inverse, and then the remaining elements of the inverse, the final overall reverse operation can be. The algorithm is described as follows:1#include 2 using namespacestd;3 #defineMAX 1004 voidNizhi (intR[],intMintN//to r

while(R;9z[i]=r-l;Tenr--; One } A Else { - intk=i-l; - if(z[k]1) thez[i]=Z[k]; - Else { -L=i; - while(R; +z[i]=r-l; -r--; + } A } at } -}View CodeThe z algorithm solves the single pattern string matching method very simply, makes S is the text string, T is the pattern string, constructs the new string p=t+ ' # ' +s, computes the Z-array, scans ba

, the contents of the file is emptied, so actually read does not have any content8content1=F.readline ()9 Print(CONTENT1)TenR=F.tell () One Print(r)#just like the above . AW=f.write ("Ok,i want to be very execellent"+"\ n") -r1=F.tell () - Print(R1)#returns 33, which is the byte length of the last written stringView CodeA + opens in read/write mode (see a)1F=open (R"C:\Users\shaopeng\Desktop\py_homework\DAY6\readme1.txt","A +", encoding='Utf-8')2R=F.t

= C.decode ('Utf-8')5 ImportRe6REGX = R' />';7PM =Re.search (REGX,SC)8CSRF = Pm.group (1)9BODY = {'username':' User','Password':' Pass','LT': CSRF,'Service':'URL'}Tenr,c = h.request (URL,'POST', body=UrlEncode (body)) One Print(C.decode ("UTF-8"))The feeling is still full of simple. Of course, we still have to use cookies to achieve the purpose, above is the main code, we can refer to the next.The variable h is defined as follows:1 h = httplib2. Http

#return7R1,R2,R3 =Func2 ()8 Print(R1,R2,R3)#Three accepted9 TenR= Func2 ()#a variable accepts One Print(r)#Output TupleParametersNo Parameters　　no content is written in parentheses when defining functions and calling functionshas one parameter　　Pass what is whathas multiple parameters　　Position Parametersat the angle of the argument:pass the parameter by locationfollow the key word parametersmixed use can: but must first follow the location of the par

Principle of divide-and-conquer algorithmDivide-and-conquer algorithm is to divide a problem of size n into K small sub-problem, these sub-problems are independent and the same nature as the original problem, find out the solution of the sub-problem, can get the solution of the original problemPseudo-code implementation of divide-and-conquer algorithmMerge algorithm Merge1 MERGE (A, p, Q, R)2N1←q-p + 13N2←r-Q4Create arrays L[1‥n1 + 1] and R[1‥N2 + 1]5 forI←1to N16 DoL[i]←a[p + i-1]7

[m] key)7L = m +1;8 Else9R =m;Ten } One returnl; A}1 intZl_bs (intLintRintkey)2 {3 intans;4 while(L R)5 {6m = (L + r) >>1;7 if(A[m] key)8L = middle +1;9 Else{Tenr = M-1; OneAns =R; A } - } - returnans; the}These two methods may be different from the one written by God Ben, but that's probably the case.In general, the dichotomy is still a tool for solving problems, if the wording of the cross

); - - } the}1#include 2#include 3#include 4 intErintNintMintAintb);5 using namespacestd;6 intMain ()7 {8 intb;9scanf"%d%d",a,b);Ten intR=10000000; One intK=er (0, r,a,b); Aprintf"%d\n", k); - return 0; - } the - intErintNintMintAintb) - { - intMid= (n+m)/2; + if(n>m) - { + returnN; A } at intCnt=max (A-mid/2+mid/6,0) +max (B-mid/3+mid/6,0); - if(Mid/6>=CNT) - { - returnER (n,mid-1, A, b); - } - Else in returnER (m

one to read6 //r=mid-1;7res=mid;8 }9 Else Tenr=mid-1; One //l=mid+1; A}1 //The first one is the two-part, the following is the floating-point binary2 #defineEPS 1e-8//defining macro Eps,eps is precision3 DoubleL,r;4 while(l+epsR) {5 DoubleMid= (L+R)/2.0;//Note that except for the 2.06 if(OK (mid)) {7L=mid;//Note that there is no minus one or one plus8 //R=mid;9 } Ten Else OneR=mid; A //L=mid; -

that he had reasoned so well that he could not help but start. Just a little bit of it. He fell asleep ...It seems that the editor does not make such a high-level replacement, I want to write a small program. well, then Python.Almost all of Python's stuff has been forgotten. helloworld, numeric to string, string intercept, in-string lookup, string traversal, file read and write, file traversal ... And so on, all to find usage from the internet ...To write out the Bumps:1 #Coding=utf82 3 defis_s

do not do any work,Because each sequence with a length of 1 is ordered.The pseudo-code of "and" in the merge sort1 MERGE (A, p, Q, R)2ni-q-p+L3rti-r-Q4Let l[1. . n1+1] End r[1. . n2+1] BeNewArrays5 fori =1 to N16L[i] = a[p + I-1]7 forj = L to N28R[J] A[q +J]9l[n+1] =∞Tenr[n+1] =∞ Onei =1 Aj =1 - forK =p to R - ifL[i] R[j] theA[K] =L[i] -i = i+1 - Else -A[K] =R[j] +j = j+1The process merge detailed work process is as

Crawler, how should the notes be written?Standard StyleThis is a standard style, r=requests.request (Get,params, and other parameters), parameters are headers, is user_agent, is the user agent, the default this is Python requests, but some sites do not support, Like Amazon. So we have to add User agent parameters, (can be replaced by the Google browser to open user interface, there is.) Also downloaded a plugin user_agent switcher, want to change what kind of can.1 ImportRequests2 ImportOS3Root

matching character matching result description7 d \d False because \ is a character with special meaning in the regular expression, so to match the \d itself, the expression \d cannot match 8 \\d \d True escape \ Then change to \ \ to match9 "\\\\d" '\\d'True If in Python, the string'\ ' also needs to be escaped, so every string'\'and you need to escape once .TenR'\\d'R'\d'True to precede the string with R, so that the entire string is

|| +===============+===================+| | Object | Dict || +---------------+-------------------+| | Array | List || +---------------+-------------------+| | string | Unicode || +---------------+-------------------+| | Number (int) | int, Long || +---------------+-------------------+| | Number (real) | float || +---------------+-------------------+| | true | True || +---------------+-------------------+| | False | False || +---------------+-------------------+| | null | None || +--------------

List common operations and Methods list classes, listsLi = [1, +, 9, "age", [P], ["+]]]," EDD ", True] objects created through the list class, LiList classAn object of the list class Li = [11, 22, 33, 22, 44]1#Conversion2# string Conversion List Li = List ("ASDFASDFASDF"), internal use for loop3s ="POUASKDFAUSPDFIAJSDKFJ"4New_li =list (s)5 Print(New_li)6 7#the list is converted into a string,8# You need to write your for loop one by one processing: both numeric and string 2018-07-239Li = [11,22,