qq_32862143的博客

第一种const reverseBetween = (head, left, right) => { const dummyHead = new ListNode(-1); dummyHead.next = head; let prev = dummyHead; let pos = 1; while(pos < left) { prev = prev.next; pos++; } let cur = prev.next; while(po

公共方法const toSum = n => String(n).split('').reduce((prev, cur) => prev += Math.pow(+cur, 2),0);第一种方法: 用数组检测循环const isHappy = (n) => { const sumArr = []; if(n === 1) { return true; } while(true) { const res = toSum(n); if(res

const groupAnagrams = (strs) => { const obj = {}; let count = 1; const res = []; for(let i = 0; i < strs.length; i++) { const cur = strs[i].split('').sort().join(''); if(obj[cur]){ res[obj[cur] - 1] = [...res[obj[cur] - 1], strs

const numberOfBoomerangs = (points) => { let res = 0; for(let i = 0; i < points.length; i++) { const obj = {}; for(let j = 0; j < points.length; j++) { if(j !== i) { if(obj[dis(points[i], points[j])]) { obj[dis(

第一种方法const hammingWeight = (n) => { n = n.toString(2); return n.split('').filter(item => item === '1').length;};第二种方法const hammingWeight = (n) => { n = n.toString(2); return n.split('').reduce((prev, cur) => { if(cur === '1') {

const fourSum = (nums, target) => { const res = []; if(nums.length < 4) { return res; } nums.sort((a, b) => a - b) for(let i = 0; i < nums.length - 3; i++) { if(i > 0 && nums[i] === nums[i - 1]) { continue;

第一种方法：const threeSum = (nums) => { if(nums.length < 2) { return []; } nums.sort((a, b) => a - b); const res = []; for(let i = 0; i < nums.length - 2; i++) { if(nums[i] > 0) { break; } if(i >= 1 &&amp

第一种方法const reverseVowels = (s) => { let vowels = s.replace(/[^AaEeIiOoUu]/g, ''); // 1）将非元音的字母过滤掉 let count = vowels.length - 1; let str = ''; for(let i = 0; i < s.length; i++) { // 2) 使用str变量来接收翻转后的结果 str += /[AaEeIiOoUu]/.test(s[i]) ?

字母异位词含义：两个字符串，每个字母出现的次数是一致的以下两种方法进行的前提是：字符串s和t的长度需一致第一种方法：const isAnagram = (s, t) => { const sLen = s.length; const tLen = t.length; if(sLen === tLen) { s = s.split('').sort(); t = t.split('').sort(); // 1）字符串转成数组并进行排序； for(let

第一种方法const isPalindrome = (s) => { s = s.toLowerCase().match(/[a-z0-9]+/g, ''); if(!s) return true; s = s.join(''); let left = 0; let right = s.length - 1; while(left < right) { if(s[left] !== s[right]){ return false;

双指针const maxArea = function(height) { let start = 0; let end = height.length - 1; let res = 0; while(start < end) { const area = Math.min(height[start], height[end]) * (end - start); res = Math.max(area, res); he

双指针const merge = (nums1, m, nums2, n) => { let p1 = 0; let p2 = 0; let res = []; while (p1 < m || p2 < n) { if(p1 === m) { res.push(nums2[p2++]); } else if(p2 === n) { res.push(nums1[p1++]);

计数统计const countSort = (arr) => { const obj = { 0:0, 1:0, 2:0 } arr.forEach(item => item < 3 && obj[item]++); return Object.keys(obj).reduce((prev, cur) => prev.concat(new Array(obj[cur]).fill(+cu