ITPub博客

从负数干到1，也是牛逼。

花了蛮长时间实现的b树插入操作。有时间再实现其他操作。#include<stdio.h>#include<stdlib.h>#defineM5enumKeyStatus{Duplicate,SearchFailure,Success,InsertIt,LessKeys};st

importreimportsysimportgetoptimportMySQLdbfromsubprocessimportcallimportoshost='10.76.45.7'port=3306user='test'password='test'dbName='test'defloadSlow

importreimportMySQLdbhost='10.76.45.7'port=3306user='test'password='test'dbName='test'defloadSlowLogtoDb(mysqlConn,keyValueList):insertSql="insertinto

三层嵌套循环不够高效，在leetcode上最后几个testcase，执行超时，无法accept。重写之前，将该实现保存publicclassSolution{publicList<List<Integer>>threeSum(int[]nums){Arrays.sort(nu

publicfinalintgetAndAddInt(Objecto,longoffset,intdelta){intv;do{v=getIntVolatile(o,offset);}while(!compareAndSwapInt(o,offset,v,v+delta));returnv;}

privatefinalNode<K,V>[]initTable(){Node<K,V>[]tab;intsc;while((tab=table)==null||tab.length==0){if((sc=sizeCtl)<0)Thread.yield();//lost

publicclassSolution{/***@params:Thefirststring*@paramb:Thesecondstring*@returntrueorfalse*/publicbooleananagram(Strings,Stringt){//writeyourcodehereMa

//youcanalsouseimports,forexample://importjava.util.*;//youcanwritetostdoutfordebuggingpurposes,e.g.//System.out.println("thisisadebugmessage");classS

/***Definitionforabinarytreenode.*publicclassTreeNode{*intval;*TreeNodeleft;*TreeNoderight;*TreeNode(intx){val=x;}*}*/publicclassSolution{publicList&l

publicintsumArray(int[]nums,intstart,intend){inti=0;intsum=0;for(i=start;i<=end;i++){sum+=nums[i];}returnsum;}publicbooleancanBalance(int[]nums){in

publicint[]fix34(int[]nums){inti3=0;inti4=0;inttemp=0;while((i3<nums.length)&&(i4<nums.length)){while(i3<nums.length){if(nums[i3]==3)

publicint[]copyEvens(int[]nums,intcount){intnewIndex=0;inti=0;intnewArray[]=newint[count];while(newIndex<count){if((nums[i]%2)==0)newArray[newIndex

publicbooleanhasOne(intn){intlastdigit=0;while(n>0){lastdigit=(n%10);if(lastdigit==1)returntrue;n=n/10;}returnfalse;}http://codingbat.com/prob/p191

publicintcommonTwo(String[]a,String[]b){intstartA=0;intstartB=0;intcount=0;while(((startA<a.length)&&(startB<b.length))){if(startA>0)

publicbooleansplitArray(int[]nums){returndividSameSumGroup(0,nums,0,0);}publicbooleandividSameSumGroup(intstart,intnums[],intsumA,intsumB){if(start&gt

publicbooleangroupNoAdj(intstart,int[]nums,inttarget){if(start>=nums.length){returntarget==0;}if(groupNoAdj(start+2,nums,target-nums[start]))return

http://codingbat.com/prob/p199368publicbooleangroupSum6(intstart,int[]nums,inttarget){if(start>=nums.length){returntarget==0;}if(nums[start]==6){if

自带测试http://codingbat.com/prob/p145416

importjava.util.*;classCounter{}classGroundhog2{intghNumber;Groundhog2(intn){ghNumber=n;}publicinthashCode(){returnghNumber;}publicbooleanequals(Objec