App下載

詞條

大約有 5,000 項符合查詢結(jié)果 ,庫內(nèi)數(shù)據(jù)總量為 78,250 項。(搜索耗時:0.0050秒)

2541.字符串截取算法挑戰(zhàn)

方法一: ```javascript function truncate(str, num) { // Clear out that junk in your trunk var a = ''; ? if(num>=str.length){ ??? return str; ? } ? if(num<=3){ ??? for(i=0;i<num;i++){ ????? a+=str[i]; ??? } ??? return a+'...'; ? } ? if(num>3&&num<str.length){ ...

http://www.o2fo.com/chun5060/chun5060-hd1o247z.html

2542.數(shù)組分割算法挑戰(zhàn)

方法一: ```javascript function chunk(arr, size) { // Break it up. var len=parseInt(arr.length/size);? ? //取模 ? var remain=arr.length%size;? ? //定義各變量 ? var a=[],count=1,sot=remain>0?len+1:len;?? ? //裝到新數(shù)組 ? for ( var f = 1; f <=sot; f++) {? ??? va...

http://www.o2fo.com/chun5060/chun5060-v2p52480.html

2543.數(shù)組截斷算法挑戰(zhàn)

方法一: ```javascript function slasher(arr, howMany) { // it doesn't always pay to be first arr=arr.slice(howMany); ?return arr; } slasher([1, 2, 3], 2); ``` 方法二: ```javascript function slasher(arr, howMany) { // it doesn't always pay to be first if(howMany === 0){ return arr; } if(arr...

http://www.o2fo.com/chun5060/chun5060-bi2n2481.html

2544.數(shù)組查詢算法挑戰(zhàn)

方法一: ```javascript function mutation(arr) { for(var i=0;i<arr[1].length;i++){ ??? if(arr[0].toLowerCase().indexOf(arr[1].substr(i,1).toLowerCase())==-1){ ????? return false; ??? } ? } ? return true; } mutation(["hello", "hey"]); ``` 方法二: ```javascript function mutatio...

http://www.o2fo.com/chun5060/chun5060-57pl2482.html

2545.刪除數(shù)組中特定值算法挑戰(zhàn)

方法一: ```javascript function bouncer(arr) { // Don't show a false ID to this bouncer. arr=arr.filter(function(val){if(val){return val;}}); ? return arr; } bouncer([7, "ate", "", false, 9]); ``` 方法二: ```javascript function bouncer(arr) { // Don't show a false ID to this bouncer. retur...

http://www.o2fo.com/chun5060/chun5060-saxw2483.html

2546.去除數(shù)組中任意多個值算法挑戰(zhàn)

方法一: ```javascript function destroyer(arr) { // Remove all the values ? var arg=arguments; ? var temp; ?? temp=function(value){return value!=arg[i];}; ? for(var i=1;i<arg.length;i++){ ????? arr=arr.filter(temp); ? } ? ? return arr; } destroyer([1, 2, 3, 1, 2, 3], 2, 3); ``` ...

http://www.o2fo.com/chun5060/chun5060-ceh32484.html

2547.數(shù)組排序并插入值算法挑戰(zhàn)

方法一: ```javascript function where(arr, num) { // Find my place in this sorted array. arr=arr.sort(function(a,b){return a-b;}); ? for(var i=0;i<arr.length;i++){ ??? if(num>arr[i]&&num<arr[i+1]){ ????? return i+1; ??? }? else if(num==arr[i]){ ????? return i; ??? }...

http://www.o2fo.com/chun5060/chun5060-e4x12485.html

2548.位移密碼算法挑戰(zhàn)

方法一: ```javascript function rot13(str) { // LBH QVQ VG! function rot13char(char){ ??? if (char.charCodeAt()>=65&&char.charCodeAt()<=90){ ????? return char.charCodeAt()>=78?String.fromCharCode(char.charCodeAt()-13):String.fromCharCode(char.charCodeAt()+13); ??? }else ??...

http://www.o2fo.com/chun5060/chun5060-p6572486.html

2549.區(qū)間求值算法挑戰(zhàn)

方法一: ```javascript function sumAll(arr) { ? var sum=0; ? var max=0; ? var min=0; ? if (arr[0]<arr[1]){ ? max=arr[1]; ??? min=arr[0]; ??? } ? else{ ? max=arr[0]; ? min=arr[1]; ? } for(var i=min;i<=max;i++){ ?sum+=i; } ? return sum; } sumAll([6, 7]); ``` 方法二: ```...

http://www.o2fo.com/chun5060/chun5060-5ka92487.html

2550.找出數(shù)組間差異算法挑戰(zhàn)

方法一: ```javascript function diff(arr1,arr2){ ? var newArr=[]; ? for(var i=0;i<arr1.length;i++){ ??? if(arr2.indexOf(arr1[i])===-1){ ????? newArr.push(arr1[i]); ??? } ? } ? for(i=0;i<arr2.length;i++){ ??? if(arr1.indexOf(arr2[i])===-1){ ????? newArr.push(arr2[i]);...

http://www.o2fo.com/chun5060/chun5060-dnlf2488.html

抱歉,暫時沒有相關(guān)的微課

w3cschool 建議您:

  • 檢查輸入的文字是否有誤

抱歉,暫時沒有相關(guān)的視頻課程

w3cschool 建議您:

  • 檢查輸入的文字是否有誤

抱歉,暫時沒有相關(guān)的教程

w3cschool 建議您:

  • 檢查輸入的文字是否有誤

2541.字符串截取算法挑戰(zhàn)

方法一: ```javascript function truncate(str, num) { // Clear out that junk in your trunk var a = ''; ? if(num>=str.length){ ??? return str; ? } ? if(num<=3){ ??? for(i=0;i<num;i++){ ????? a+=str[i]; ??? } ??? return a+'...'; ? } ? if(num>3&&num<str.length){ ...

http://www.o2fo.com/chun5060/chun5060-hd1o247z.html

2542.數(shù)組分割算法挑戰(zhàn)

方法一: ```javascript function chunk(arr, size) { // Break it up. var len=parseInt(arr.length/size);? ? //取模 ? var remain=arr.length%size;? ? //定義各變量 ? var a=[],count=1,sot=remain>0?len+1:len;?? ? //裝到新數(shù)組 ? for ( var f = 1; f <=sot; f++) {? ??? va...

http://www.o2fo.com/chun5060/chun5060-v2p52480.html

2543.數(shù)組截斷算法挑戰(zhàn)

方法一: ```javascript function slasher(arr, howMany) { // it doesn't always pay to be first arr=arr.slice(howMany); ?return arr; } slasher([1, 2, 3], 2); ``` 方法二: ```javascript function slasher(arr, howMany) { // it doesn't always pay to be first if(howMany === 0){ return arr; } if(arr...

http://www.o2fo.com/chun5060/chun5060-bi2n2481.html

2544.數(shù)組查詢算法挑戰(zhàn)

方法一: ```javascript function mutation(arr) { for(var i=0;i<arr[1].length;i++){ ??? if(arr[0].toLowerCase().indexOf(arr[1].substr(i,1).toLowerCase())==-1){ ????? return false; ??? } ? } ? return true; } mutation(["hello", "hey"]); ``` 方法二: ```javascript function mutatio...

http://www.o2fo.com/chun5060/chun5060-57pl2482.html

2545.刪除數(shù)組中特定值算法挑戰(zhàn)

方法一: ```javascript function bouncer(arr) { // Don't show a false ID to this bouncer. arr=arr.filter(function(val){if(val){return val;}}); ? return arr; } bouncer([7, "ate", "", false, 9]); ``` 方法二: ```javascript function bouncer(arr) { // Don't show a false ID to this bouncer. retur...

http://www.o2fo.com/chun5060/chun5060-saxw2483.html

2546.去除數(shù)組中任意多個值算法挑戰(zhàn)

方法一: ```javascript function destroyer(arr) { // Remove all the values ? var arg=arguments; ? var temp; ?? temp=function(value){return value!=arg[i];}; ? for(var i=1;i<arg.length;i++){ ????? arr=arr.filter(temp); ? } ? ? return arr; } destroyer([1, 2, 3, 1, 2, 3], 2, 3); ``` ...

http://www.o2fo.com/chun5060/chun5060-ceh32484.html

2547.數(shù)組排序并插入值算法挑戰(zhàn)

方法一: ```javascript function where(arr, num) { // Find my place in this sorted array. arr=arr.sort(function(a,b){return a-b;}); ? for(var i=0;i<arr.length;i++){ ??? if(num>arr[i]&&num<arr[i+1]){ ????? return i+1; ??? }? else if(num==arr[i]){ ????? return i; ??? }...

http://www.o2fo.com/chun5060/chun5060-e4x12485.html

2548.位移密碼算法挑戰(zhàn)

方法一: ```javascript function rot13(str) { // LBH QVQ VG! function rot13char(char){ ??? if (char.charCodeAt()>=65&&char.charCodeAt()<=90){ ????? return char.charCodeAt()>=78?String.fromCharCode(char.charCodeAt()-13):String.fromCharCode(char.charCodeAt()+13); ??? }else ??...

http://www.o2fo.com/chun5060/chun5060-p6572486.html

2549.區(qū)間求值算法挑戰(zhàn)

方法一: ```javascript function sumAll(arr) { ? var sum=0; ? var max=0; ? var min=0; ? if (arr[0]<arr[1]){ ? max=arr[1]; ??? min=arr[0]; ??? } ? else{ ? max=arr[0]; ? min=arr[1]; ? } for(var i=min;i<=max;i++){ ?sum+=i; } ? return sum; } sumAll([6, 7]); ``` 方法二: ```...

http://www.o2fo.com/chun5060/chun5060-5ka92487.html

2550.找出數(shù)組間差異算法挑戰(zhàn)

方法一: ```javascript function diff(arr1,arr2){ ? var newArr=[]; ? for(var i=0;i<arr1.length;i++){ ??? if(arr2.indexOf(arr1[i])===-1){ ????? newArr.push(arr1[i]); ??? } ? } ? for(i=0;i<arr2.length;i++){ ??? if(arr1.indexOf(arr2[i])===-1){ ????? newArr.push(arr2[i]);...

http://www.o2fo.com/chun5060/chun5060-dnlf2488.html

抱歉,暫時沒有相關(guān)的文章

w3cschool 建議您:

  • 檢查輸入的文字是否有誤

熱門課程