caigouyimei的博客

react,create-react-app脚手架配置mars3d-cesium

//判断是否为回文序列 function isPalindrome(s){ let rev = s.split('').reverse().join(''); //字符串逆转操作 return rev === s; } //找出最长回文序列 function longestPalindrome(str){ let palindromeStr=""; //记录最长回文串 let tempPalindrome=""; //记录当前回文串 for(let i=0;i<s

法一：使用for…in…循环 var obj = {'0':'a', '1':'b', '2':'c'}; for(let i in obj){ console.log(i,":",obj[i]);//{0:a,1:b,2:c} } 法二：使用Object.keys遍历 var obj = {'0':'a', '1':'b', '2':'c'}; Object.keys(obj).forEach(function(key){ console.log(key,obj[key]);//{0:a,1:

function frequent(arr){ let objGroup = arr.reduce(function(obj, name){ obj[name] = obj[name] ? ++obj[name] : 1; }, {}); return objGroup; } let arr = [1, 2, 2, 2, 3, 3, 3]; //objKey是对象的键名构成的数组 let objKey = Object.keys(frequent(arr)); //

二分法JavaScript //寻找左边界 function findLeftBound(nums,target){ if (nums.length == 0) return -1; //关键代码 /******/ let left = 0; let right = nums.length; while (left < right){ let mid = left + Math.floor((right - left)/2); if(nums[mid] >