随笔分类 - LeetCode
1
摘要:1 var findKth = function(nums1, nums2, k) { 2 if (nums1.length > nums2.length) { 3 return findKth(nums2, nums1, k); 4 } 5 if (num...
阅读全文
摘要:1 var convert = function(s, numRows) { 2 if (numRows === 1) { 3 return s; 4 } 5 6 var i, j, 7 count = 0, 8 colDi...
阅读全文
摘要:1 var lengthOfLongestSubstring = function(s) { 2 if (s === '') { 3 return 0; 4 } 5 6 var lenMax = 1, 7 lenCurr = 1, 8 ...
阅读全文
摘要:1 var reverse = function(x) { 2 var isNeg = false, 3 res = 0, 4 temp = 0; 5 6 if (x 2147483648) {14 return 0;15...
阅读全文
摘要:1 var longestPalindrome = function(s) { 2 if (s.length == 0) { 3 return s; 4 } 5 6 var n = s.length; 7 var longest = s[0]; 8...
阅读全文
摘要:1 var roman = [ 2 ["", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"], 3 ["", "X", "XX", "XXX", "XL", "L", "LX", "LX
阅读全文
摘要:1 var isPalindrome = function(x) { 2 var xR = 0, 3 xP = x > 0 ? x : -x; 4 5 while (xP != 0) { 6 xR = xR * 10 + (xP % 10); 7 ...
阅读全文
摘要:1 var myAtoi = function(str) { 2 var res = 0, 3 i = 0, 4 isNegtive = false, 5 isFirst = true; 6 7 8 for (i = 0; i =...
阅读全文
摘要:1 var maxArea = function(height) { 2 var max = 0, 3 l = 0, 4 r = height.length - 1; 5 6 while (l max ? capacity : max; 9 ...
阅读全文
摘要:1 var threeSum = function(nums) { 2 var res = [], 3 i, l, r, sum; 4 5 if (nums.length 0) {25 r--;26 } e...
阅读全文
摘要:1 var roman = { 2 "I": 1, 3 "V": 5, 4 "X": 10, 5 "L": 50, 6 "C": 100, 7 "D": 500, 8 "M": 1000 9 };10 11 var romanToInt = ...
阅读全文
摘要:1 var threeSumClosest = function(nums, target) { 2 if (nums.length target) {32 r--;33 } else {34 ...
阅读全文
摘要:1 var longestCommonPrefix = function(strs) { 2 if (strs.length < 1) { 3 return ""; 4 } 5 6 var prefix = strs[0]; 7 8 for (v...
阅读全文
摘要:1 var fourSum = function(nums, target) { 2 if (nums.length i + 1 && nums[j] === nums[j - 1]) {23 continue;24 }25 26 ...
阅读全文
摘要:1 var arr = [ 2 [], 3 [], 4 ['a', 'b', 'c'], 5 ['d', 'e', 'f'], 6 ['g', 'h', 'i'], 7 ['j', 'k', 'l'], 8 ['m', 'n', 'o'], ...
阅读全文
摘要:1 /** 2 * Definition for singly-linked list. 3 * function ListNode(val) { 4 * this.val = val; 5 * this.next = null; 6 * } 7 */ 8 /** 9 ...
阅读全文
摘要:1 /** 2 * Definition for singly-linked list. 3 * function ListNode(val) { 4 * this.val = val; 5 * this.next = null; 6 * } 7 */ 8 /** 9 ...
阅读全文
摘要:1 var addTwoNumbers = function(l1, l2) { 2 var sum = l1.val + l2.val, 3 l3 = new ListNode(sum % 10), 4 node = l3; 5 6 l1 = l...
阅读全文
摘要:1 /** 2 * @param {string} s 3 * @return {boolean} 4 */ 5 var isValid = function(s) { 6 var stack = []; 7 8 for (var i = 0; i < s.length; ...
阅读全文
摘要:1 var twoSum = function(nums, target) { 2 var len = nums.length, 3 i = 0, 4 hash = {}, 5 res = [], 6 t1, t2; 7 8...
阅读全文
1

浙公网安备 33010602011771号