weixin_47348711的博客

【LeetCode】36. 有效的数独—JavaScript解法示例 1：输入：board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7","."

【LeetCode】7. 整数反转—JavaScript解法原题链接:https://leetcode-cn.com/problems/reverse-integer//** * @param {number} x * @return {number} */var reverse = function(x) { if (typeof x !== 'number') { return 0 } var f = 1 if(x<0){

【LeetCode】28. 实现 strStr()—JavaScript解法原文链接:https://leetcode-cn.com/problems/implement-strstr//** * @param {string} haystack * @param {string} needle * @return {number} */var strStr = function(haystack, needle) { return needle=='' ?0:haystack.in

【LeetCode】27. 移除元素—JavaScript解法原题链接:https://leetcode-cn.com/problems/remove-element//** * @param {number[]} nums * @param {number} val * @return {number} */var removeElement = function(nums, val) { var len=0; for(var i=0;i<nums.length;i+

【LeetCode】26. 删除有序数组中的重复项—JavaScript解法原题链接:https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array/** * @param {number[]} nums * @return {number} */var removeDuplicates = function(nums) { var num = 1; for(var i =1;i<nums.leng