未来之歌

代码如下//Definition for singly-linked list.function ListNode(val, next) { this.val = (val === undefined ? 0 : val) this.next = (next === undefined ? null : next)}/** * @param {ListNode} l1 * @param {ListNode} l2 * @return {ListNode} */var

代码如下/** * @param {string[]} strs * @return {string} */var longestCommonPrefix = function (strs) { console.log(strs); if (strs.length === 0) { return ''; } let commonStr = "" let curPos = 0; while (true) { let th

解答/** * 方法1 翻转字符串看是否相等 * @param {number} x * @return {boolean} */var isPalindrome = function (x) { let xStr = x + ''; let revStr = xStr.split('').reverse().join(''); return xStr === revStr;};// 方法2 通过字符串前后一一对比判断var isPalindrome2 = fun

代码如下/** * @param {string} s * @return {number} */var lengthOfLongestSubstring = function (s) { let maxLongStr = ''; for (let index = 0; index < s.length; index++) { let subStr = s.substr(index, s.length); let tempSubStr = ge

// 结点定义function ListNode(val, next) { this.val = (val === undefined ? 0 : val) this.next = (next === undefined ? null : next)}/** * @param {ListNode} l1 * @param {ListNode} l2 * @return {ListNode} */var addTwoNumbers = function (l1, l2) {

两数之和给定一个整数数组 nums 和一个整数目标值 target，请你在该数组中找出 和为目标值 的那 两个 整数，并返回它们的数组下标。你可以假设每种输入只会对应一个答案。但是，数组中同一个元素不能使用两遍。你可以按任意顺序返回答案。题解：/** * @param {number[]} nums * @param {number} target * @return {number[]} */var twoSum = function (nums, target) { let

英文描述You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and re...

英文描述Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the...

无重复字符的最长子串英文描述Given a string, find the length of the longest substring without repeating characters.Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the...

颠倒整数英文描述Given a 32-bit signed integer, reverse digits of an integer.Example 1: Input: 123 Output: 321Example 2: Input: -123 Output: -321Example 3: Input: 120 Output: 21Note: ...

判断回文数英文描述Determine whether an integer is a palindrome. Do this without extra space.Some hints: Could negative integers be palindromes? (ie, -1)If you are thinking of converting the intege...