Commitb517b1a

Chihung Yu

committed

update

1 parentdbcd817 commitb517b1aCopy full SHA for b517b1a

File tree

+64

-3

lines changed

+64

-3

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -33,8 +33,8 @@ var threeSum = function(nums) {`
`33`	`33`
`34`	`34`	`for(vari=0;i<len-2;i++){`
`35`	`35`
`36`		`-if(i===0\|\|nums[i]>nums[i-1]){// very important, same as line 40, remove duplicate as 111 will only run once 1-> rathertan 1 1 1`
`37`		`-target=0-nums[i];`
	`36`	`+if(i===0\|\|nums[i]>nums[i-1]){// very important, same as line 40, remove duplicate as 111 will only run once 1-> ratherthan 1 1 1`
	`37`	`+vartarget=0-nums[i];`
`38`	`38`
`39`	`39`	`j=i+1;`
`40`	`40`	`k=len-1;`

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -63,3 +63,36 @@ var solution = function(read4) {`
`63`	`63`	`returnnumChrRead;`
`64`	`64`	`};`
`65`	`65`	`};`
	`66`	`+`
	`67`	`+varsolution=function(read4){`
	`68`	`+/**`
	`69`	`+ *@param {character[]} buf Destination buffer`
	`70`	`+ *@param {number} n Number of characters to read`
	`71`	`+ *@return {number} The number of actual characters read`
	`72`	`+ */`
	`73`	`+varread4Buff=[];`
	`74`	`+varread4NumCharRead=0;`
	`75`	`+varread4Remain=0;`
	`76`	`+`
	`77`	`+returnfunction(buf,n){`
	`78`	`+varnumCharRead=0;`
	`79`	`+`
	`80`	`+// Need to run read4 N times to get n char`
	`81`	`+while(numCharRead<n){`
	`82`	`+// If everything is already read in read4 buffer, re-read`
	`83`	`+if(read4NumCharRead===read4Remain){`
	`84`	`+read4NumCharRead=0;`
	`85`	`+read4Remain=read4(read4Buff);`
	`86`	`+}`
	`87`	`+while(read4NumCharRead<read4Remain&&numCharRead<n){`
	`88`	`+buf[numCharRead++]=read4Buff[read4NumCharRead++];`
	`89`	`+}`
	`90`	`+if(read4Remain<4){`
	`91`	`+break;`
	`92`	`+}`
	`93`	`+`
	`94`	`+}`
	`95`	`+`
	`96`	`+returnnumCharRead;`
	`97`	`+};`
	`98`	`+};`

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -64,7 +64,6 @@ var lengthOfLongestSubstringTwoDistinct = function(s) {`
`64`	`64`	`if(map.size===2&&map.get(c)===undefined){`
`65`	`65`	`varcurStr;`
`66`	`66`	`if(i-start>maxLen){`
`67`		`-curStr=s.substring(start,i);`
`68`	`67`	`maxLen=i-start;`
`69`	`68`	`}`
`70`	`69`	`varleftMost=s.length;`

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,35 @@`
`2`	`2`	`*@param {number[]} digits`
`3`	`3`	`*@return {number[]}`
`4`	`4`	`*/`
	`5`	`+`
	`6`	`+// Time complexity : \mathcal{O}(N)O(N) since it's not more than one pass along the input list.`
	`7`	`+`
	`8`	`+// Space complexity : \mathcal{O}(1)O(1).`
	`9`	`+varplusOne=function(digits){`
	`10`	`+varcarry=1;`
	`11`	`+for(vari=digits.length-1;i>-1;i--){`
	`12`	`+vard=digits[i];`
	`13`	`+varsum=d+carry;`
	`14`	`+if(sum===10){`
	`15`	`+digits[i]=0;`
	`16`	`+carry=1;`
	`17`	`+}else{`
	`18`	`+digits[i]=sum;`
	`19`	`+carry=0;// can directly return since it will not trigger the carry unshift at the end.`
	`20`	`+break;`
	`21`	`+}`
	`22`	`+}`
	`23`	`+`
	`24`	`+if(carry===1){`
	`25`	`+digits.unshift(carry);`
	`26`	`+}`
	`27`	`+`
	`28`	`+returndigits;`
	`29`	`+};`
	`30`	`+`
	`31`	`+`
	`32`	`+`
	`33`	`+`
`5`	`34`	`varplusOne=function(digits){`
`6`	`35`	`for(vari=digits.length;i--;){`
`7`	`36`	`digits[i]=1+digits[i];`

Comments

(0)