孙佰贵的专栏

// you can also use includes, for example:// #include int solution(vector &A) { // write your code in C++98 //enumate each element in the array, if it's not in the right place, then try to f

// you can also use includes, for example:// #include int solution(const vector &A) { // write your code in C++98 //...traverse the array from both direction, and move according to the

// you can also use includes, for example:// #include int getDepth(tree* T){ if(!T) return 0; return max(getDepth(T->l), getDepth(T->r))+1;}int solution(tree * T) { // write your code

// you can also use includes, for example:// #include int solution(const vector &A) { // write your code in C++98 //...keep record of all the elements that exist in the array vector exis

题目：A non-empty zero-indexed array A consisting of N integers is given. Array A represents numbers on a tape.Any integer P, such that 0 The difference between the two parts is the value of: |

最近在学scala语言，scala代码如下：import scala.collection.JavaConversions._object Solution { def solution(A: Array[Int]): Int = { // write your code in Scala 2.10 // using quick sort to so

题目网址：https://codility.com/c/run/demoR97YT5-9FEPython代码如下（最近在熟悉Python所以接下来的解题报告会尽量使用Python）：def solution(A, B, C): # write your code in Python 2.6 # for each plank find the nearest nail

题目网址：https://codility.com/c/run/demoR97YT5-9FEPython代码如下（最近在熟悉Python所以接下来的解题报告会尽量使用Python）：def solution(K, A): # write your code in Python 2.6 # each time given an expected minimum sum 'em

最近在学scala语言，scala代码如下：import scala.collection.JavaConversions._import scala.util.control.Breaks._object Solution { def solution(A: Array[Int]): Int = { // write your code in Scala 2.10

最近在学scala语言，scala代码如下：import scala.collection.JavaConversions._object Solution { def solution(A: Int, B: Int, K: Int): Int = { // write your code in Scala 2.10 var cnt: Int = 0

最近在学scala语言，scala代码如下：import scala.collection.JavaConversions._object Solution { def solution(A: Array[Int]): Int = { // write your code in Scala 2.10 // sort scala.uti

Python代码如下：def solution(N, A): # write your code in Python 2.6 maxCount = 0 lastMaxSetter = 0 counters = [0]*N for op in A: if op == N+1: lastMaxSetter = maxC

Python代码如下：def solution(X, A): # write your code in Python 2.6 checkCrucialTable = [False]*X crucialCnt = 0 for i in xrange(0, len(A)): if not checkCrucialTable[A[i]-1]:

Python代码如下：def solution(A): # write your code in Python 2.6 checkTable = [False]*len(A) for value in A: if value len(A): return 0 checkTable[value-1] = True

Python代码如下：def solution(A): # write your code in Python 2.6 curSum = 0 originalSum = 0 if len(A)%2 == 0: originalSum = (len(A)+1)*((len(A)+2)/2) else: originalSum

Python代码如下：def solution(X, Y, D): # write your code in Python 2.6 dis = Y-X if dis%D == 0: return dis/D else: return dis/D+1 pass

Python代码如下：def solution(A): # write your code in Python 2.6 curZeroCnt = 0 totalPairs = 0 for value in A: if value == 0: curZeroCnt += 1 else:

Python代码如下：def solution(S, P, Q): # write your code in Python 2.6 dict = {'A':0, 'C':1, 'G':2, 'T':3} nuclSumTable = [[0 for col in range(len(S)+1)] for row in range(4)] #print nuc

// you can also use includes, for example:// #include #includeint solution(vector &A, vector &B) { // write your code in C++98 //...first transform the dry well to a sorted one in decreasin

// you can also use includes, for example:// #include #include int solution(const vector &A) { // write your code in C++98 //...find out the minimum price you haved scaned, then we can

// you can also use includes, for example:// #include long long getInversionCount(vector& workArr, int start, int end){ if(start >= end) return 0; int mid = start+(end-start)/2; long lo

// you can also use includes, for example:// #include #includeint solution(vector &A) { // write your code in C++98 if(A.size() < 2) return 0; //...precalculate the sum array vector

// you can also use includes, for example:// #include int solution(vector &A) { // write your code in C++98 //...modify the input array, let all the elements in the right place for(int i

// you can also use includes, for example:// #include int solution(vector &A) { // write your code in C++98 //...limit result int MAX_LIMIT = 1000000000; //...keep record of prefix z

// you can also use includes, for example:// #include #includeint solution(const vector &A) { // write your code in C++98 if(A.size() < 3) return 0; vector sortedEdge = A; //...sort

// you can also use includes, for example:#include struct IntervalSeg{ long long left, right; IntervalSeg(long long _left = 0, long long _right = 0):left(_left),right(_right){} bool ope

// you can also use includes, for example:// #include #include int solution(const string &S) { // write your code in C++98 //...using stack to verify if it is properly nested stack char

// you can also use includes, for example:// #include #include int solution(vector &A, vector &B) { // write your code in C++98 //...keep record of downstream fishs in stack stack down

// you can also use includes, for example:// #include int solution(const vector &A) { // write your code in C++98 //...record the count of current winner number, then int winnerNumber;

// you can also use includes, for example:// #include int getLeaderIndex(const vector &A){ //...record the count of current winner number, then int winnerNumber; int winnerNumberLeftCou

// you can also use includes, for example:// #include int solution(int X, int Y, int D) { // write your code in C++98 int totalDis = Y-X; int remainder = totalDis%D; int quotient = t

// you can also use includes, for example:// #include #includeint solution(int X, vector &A) { // write your code in C++98 //...out of range case if(X > A.size()) return -1; //...ke

// you can also use includes, for example:// #include vector solution(int N, vector &A) { // write your code in C++98 //...keep record of minValue across the whole array to reach O(n+m) time

// you can also use includes, for example:// #include vector solution(string &S, vector &P, vector &Q) { // write your code in C++98 vector result(P.size()); //...keep record of the pref

// you can also use includes, for example:#include #include int solution(vector &A) { // write your code in C++98 //...sort A first sort(A.begin(), A.end()); //...enumerate Q, and t

// you can also use includes, for example:// #include #include int solution(const vector &H) { // write your code in C++98 //...using queue + greedy int blockCnt = 0; stack wallStac

// you can also use includes, for example:// #include int solution(int N) { // write your code in C++98 //...traverse the binary representation from low digit to high, //keep record of m

// you can also use includes, for example:// #include int solution(const vector &A) { // write your code in C++98 //...calculate the sum of the array first long long sum = 0; for(int

Python代码如下：def solution(A): # write your code in Python 2.6 # if one slice is the MA, then the average of its subslices # can not be smaller and also it can not be bigger, or the avera