function Find(target, array)
{var row=array.length;if(row==0){return false;}var col=array[0].length;var i=row-1,j=0;  //以最后一行第一列为基准while(i>=0&&j<col){ //循环if(array[i][j]<target){ //待查找值大，继续向右查找j++;}else if(array[i][j]>target){ //待查找值小，向上继续查找i--;}else{   //找到return true;}}

function replaceSpace(str)
{var newstr;newstr=str.replace(/\s/g,"%20"); //正则表达式匹配，替换return newstr;
}
或
function replaceSpace(str)
{if(str.length==0){return str;}var len=str.length; //将输入字符串长度存储起来var str1=""; //定义一个新的空字符串for(var i=0;i<len;i++){ if(str[i]==' '){  //如果读取到str的空格处，用“%20”赋值到str1str1+="%20";}else{str1+=str[i];//如果读取到str的非空格处，将str该处的字符赋值给str1}}return str1;  //返回str1
}

function printListFromTailToHead(head)
{var lst=[]; //定义一个数组while(head!=null){  //将链表中的元素push进数组lst.push(head.val); //将链表的头指针指向的元素push进数组head=head.next;  //指针指向后移}lst.reverse();  //利用reverse()方法将数组颠倒顺序return lst;  //返回颠倒后的数组
}

function Stack(){       //定义栈及栈中方法this.dataStore =[]this.top =0this.psh=pshthis.empty=emptythis.pp=pp}function empty(){        return this.top<=0}function psh(element){this.dataStore[this.top++] = element}function pp(){if(this.empty()){return 0;}return this.dataStore[--this.top]}var stack1 = new Stack()    var stack2 = new Stack()function push(node){     //将节点push进栈1中stack1.psh(node)}function pop(){if(stack2.empty()){        //判断栈2是否为空，当栈2为空时，再将栈1里的数据push进栈2，每次将栈2中的数据全部pop出去while(!stack1.empty()){stack2.psh(stack1.pp())}}return stack2.pp()               //返回栈2pop出去的数据}

function minNumberInRotateArray(rotateArray)
{var len=rotateArray.length;if(len==0){return 0;}else if( len==1){return rotateArray[0];}for(var i=len-1;i>=1;i--){if(rotateArray[i]<rotateArray[i-1]){return rotateArray[i];}}return rotateArray[0];
}

function Fibonacci(n)
{if(n==0){return 0;}var fn=[1,1];  //最开始的两个数for(var i=2;i<n;i++){fn[i]=fn[i-1]+fn[i-2] //后一个数为前两个数之和，递归}return fn[n-1];  //返回数组的第n个数
}

jumpFloor(number)
{ functionif(number<=0){return 0;}var jump=[1,2];for(var i=2;i<number;i++){jump[i]=jump[i-1]+jump[i-2];}return jump[number-1];
}

function jumpFloorII(number)
{if(number <= 0){return 0;}var jump=1;for(var i=1;i<number;i++){jump*=2;}return jump;
}或

function jumpFloorII(number) {  
   if(number<0){
       return 0;
   }
    return Math.pow(2,number-1);
}

function rectCover(number)
{if(number<=0){return 0;}var Fn=[1,2];for(var i=2;i<number;i++){Fn[i]=Fn[i-1]+Fn[i-2];}return Fn[number-1];
}