合集-leetcode
摘要：1 /** 2 * @param {string} s 3 * @param {number} numRows 4 * @return {string} 5 */ 6 var convert = function (s, numRows) { 7 if (numRows 1) { 8 return
阅读全文
摘要：/** * @param {number} x * @return {number} */ var reverse = function (x) { let result = 0; let p = 1; if (x < 0) { x = -x; p = -1; } while (x > 0) { l
阅读全文
摘要：/** * @param {string} s * @return {string} */ var longestPalindrome = function (s) { let ll = s.length; let left = 0; let right = 1; let p = 0; while
阅读全文
摘要：/** * @param {number[]} nums1 * @param {number[]} nums2 * @return {number} */ var findMedianSortedArrays = function (nums1, nums2) { const nums = nums
阅读全文
摘要：/** * @param {string} s * @return {number} */ var lengthOfLongestSubstring = function (s) { let max = 0; let num = 0; let hasp; const hashMap = new Ma
阅读全文
摘要：1 /** 2 * @param {ListNode} l1 3 * @param {ListNode} l2 4 * @return {ListNode} 5 */ 6 var addTwoNumbers = function (l1, l2) { 7 let addOne = 0 8 let s
阅读全文
摘要：1 /** 2 * @param {number[]} nums 3 * @param {number} target 4 * @return {number[]} 5 */ 6 var twoSum = function (nums, target) { 7 const ll = nums.len
阅读全文
摘要：/** * @param {string} s * @return {number} */ var myAtoi = function (s) { // 正负号默认为正 let res = 0; let negativeSymbol = 1; s = s.trim(); for (let i = 0
阅读全文
摘要：/** * @param {number} x * @return {boolean} */ var isPalindrome = function (x) { if (x 0) return true; if (x < 0 || x % 10 0) { return false; } let y
阅读全文
摘要：/** * @param {string} s * @param {string} p * @return {boolean} */ var isMatch = function (s, p) { if (s == null || p == null) return false;//极端情况 s和p
阅读全文
摘要：// @lc code=start /** * @param {number[]} height * @return {number} */ var maxArea = function (height) { let left = 0; let right = height.length - 1;
阅读全文
摘要：// @lc code=start /** * @param {number} num * @return {string} */ var intToRoman = function (num) { const nums = [1000, 900, 500, 400, 100, 90, 50, 40
阅读全文
摘要：// @lc code=start /** * @param {string} s * @return {number} */ var romanToInt = function (s) { const getValue = (a) => { switch (a) { case 'I': retur
阅读全文
摘要：// @lc code=start /** * @param {string[]} strs * @return {string} */ var longestCommonPrefix = function (strs) { var ll = strs.length; if (ll 0) { ret
阅读全文
摘要：// @lc code=start /** * @param {number[]} nums * @return {number[][]} */ var threeSum = function (nums) { const lists = []; nums.sort((a, b) => a - b)
阅读全文
摘要：/** * @param {number[]} nums * @param {number} target * @return {number} */ var threeSumClosest = function (nums, target) { nums.sort((a, b) => a - b)
阅读全文
摘要：/** * @param {string} digits * @return {string[]} */ var letterCombinations = function (digits) { if (digits null || digits.length 0) { return []; } e
阅读全文
摘要：/** * @param {number[]} nums * @param {number} target * @return {number[][]} */ var fourSum = function (nums, target) { const res = []; const n = nums
阅读全文
摘要：/** * Definition for singly-linked list. * function ListNode(val, next) { * this.val = (val undefined ? 0 : val) * this.next = (next undefined ? null
阅读全文
摘要：/** * @param {string} s * @return {boolean} */ var isValid = function (s) { let stack = []; for (let c of s) { if (c '(') { stack.push(')'); } else if
阅读全文
