leetcode
玉儿Qi
NOW OR NEVER
展开
-
LeetCode -- 515、654 题解
515:Find Largest Value in Each Tree Row/** * Definition for a binary tree node. * function TreeNode(val) { * this.val = val; * this.left = this.right = null; * } *//** * @param {Tree...原创 2018-03-04 23:47:49 · 737 阅读 · 0 评论 -
[leetcode]136. Single Number -- JavaScript 代码
[leetcode]136. Single Number -- JavaScript 代码原创 2016-08-13 09:29:09 · 1014 阅读 · 0 评论 -
[leetcode]1. Two Sum -- JavaScript 代码
[leetcode]1. Two Sum -- JavaScript 代码原创 2016-09-04 15:23:20 · 1265 阅读 · 2 评论 -
[leetcode]236. Lowest Common Ancestor of a Binary Tree -- JavaScript 代码
[leetcode]236. Lowest Common Ancestor of a Binary Tree -- JavaScript 代码原创 2016-08-25 09:27:08 · 456 阅读 · 0 评论 -
[leetcode]224. Basic Calculator --JavaScript 代码
[leetcode]224. Basic Calculator --JavaScript 代码原创 2016-08-12 15:50:43 · 746 阅读 · 0 评论 -
[leetcode]179. Largest Number -- JavaScript 代码
[leetcode]179. Largest Number -- JavaScript 代码原创 2016-08-24 13:15:15 · 543 阅读 · 0 评论 -
[leetcode]54. Spiral Matrix -- JavaScript 代码
[leetcode]54. Spiral Matrix -- JavaScript 代码原创 2016-08-23 17:22:44 · 590 阅读 · 0 评论 -
[leetcode]240. Search a 2D Matrix II
[leetcode]240. Search a 2D Matrix II转载 2016-08-11 15:36:21 · 325 阅读 · 0 评论 -
[leetcode]74. Search a 2D Matrix -- JavaScript 代码
[leetcode]74. Search a 2D Matrix -- JavaScript 代码原创 2016-08-11 14:45:24 · 587 阅读 · 0 评论 -
[leetcode]79. Word Search -- JavaScript 代码
[leetcode]79. Word Search -- JavaScript 代码原创 2016-08-23 15:52:08 · 929 阅读 · 0 评论 -
[leetcode]78. Subsets -- JavaScript 代码
[leetcode]78. Subsets -- JavaScript 代码原创 2016-08-23 11:17:35 · 831 阅读 · 0 评论 -
[leetcode]98. Validate Binary Search Tree -- JavaScript 代码
[leetcode]98. Validate Binary Search Tree -- JavaScript 代码原创 2016-08-22 15:47:33 · 901 阅读 · 0 评论 -
JavaScript笔记:事件
JavaScript笔记:事件1、事件流2、事件处理程序3、事件对象4、事件类型5、内存和性能原创 2016-09-01 15:27:59 · 709 阅读 · 0 评论 -
[leetcode]144. Binary Tree Preorder Traversal -- JavaScript 代码
[leetcode]144. Binary Tree Preorder Traversal -- JavaScript 代码原创 2016-08-25 15:01:18 · 487 阅读 · 0 评论 -
[leetcode]238. Product of Array Except Self -- Java 代码
[leetcode]238. Product of Array Except Self -- Java 代码转载 2016-08-25 21:31:25 · 365 阅读 · 0 评论 -
[leetcode]513. Find Bottom Left Tree Value
这道题的要求是寻找最深的一层中最靠左的节点的value。分析一下题目,优先的节点应该是深度最深的节点,只要这个节点的深度大于所有的节点,就算它是某个节点的右边右边右边节点,那么也应该返回这个节点的值。其次,在几个节点深度相同的时候,我们应该选择最左边的那个。根据这个思路,代码如下:var findBottomLeftValue = function(root) { var nodeLefte原创 2017-03-27 11:45:02 · 363 阅读 · 0 评论 -
[leetcode] 498. Diagonal Traverse -- JavaScript 代码
var findDiagonalOrder = function(matrix) { var result = []; var row = matrix.length; if(row === 0){ return result; } var col = matrix[0].length; var rIndex = 0; var原创 2017-03-31 16:46:32 · 569 阅读 · 0 评论 -
[leetcode] 406. Queue Reconstruction by Height -- JavaScript 代码
先上代码:var reconstructQueue = function(people) { //var length = people.length; people.sort(function(a,b){ if(a[0]<b[0]){ return 1; }else if(a[0]>b[0]){ ret原创 2017-03-31 11:02:42 · 452 阅读 · 0 评论 -
[leetcode] 518. Coin Change 2 -- JavaScript 代码【动态规划】
var change = function(amount, coins) { var dpArray = []; for(let i=0;i<amount+2;i++){ dpArray[i] = 0; } dpArray[0] = 1; coins.forEach(function(coin){ for (var i = co原创 2017-03-30 10:48:21 · 1001 阅读 · 0 评论 -
[leetcode] 287. Find the Duplicate Number -- JavaScript代码
先上代码:var findDuplicate = function(nums){ if (nums.length > 1){ var slow = nums[0]; var fast = nums[nums[0]]; while (slow != fast){ slow = nums[slow];翻译 2017-03-29 17:11:17 · 435 阅读 · 0 评论 -
[leetcode] 477. Total Hamming Distance -- JavaScript 代码
一开始我使用的方法是两轮for循环,将每一组数字都做异或然后去求汉明距离,但是这样会超时。于是参考了leetcode上大神的Java代码:var totalHammingDistance = function(nums) { var sum = 0; var length = nums.length; for(let i=0;i<32;i++){ var tm翻译 2017-03-29 14:59:55 · 507 阅读 · 0 评论 -
[leetcode]494. Target Sum -- JavaScript动态规划求解
先上代码:var findTargetSumWays = function(nums, S) { var sum = 0; nums.forEach(function(num){ sum += num; }); if(S>sum || S<-sum) return 0; var dp = []; dp[0+sum] = 1; v原创 2017-03-28 15:31:34 · 861 阅读 · 0 评论 -
[leetcode]442. Find All Duplicates in an Array -- JavaScript代码
一开始看到这个题目,就是觉得是用异或的思路来写,想了半天也没有结果。。。后来看了大神的解析,发现自己忽略了一个很重要的题目条件:1 ≤ a[i] ≤ n (n = size of array)。这道题的思路就是,将元素的绝对值减去一作为一个index,然后去寻找数组中下标为index的元素并将其设置为负数(这也就是为什么在前面要将元素取绝对值),这样依此进行下去,如果在寻找的过程中,发现nums[i原创 2017-03-27 16:36:26 · 335 阅读 · 0 评论 -
[leetcode]89. Gray Code -- JavaScript 代码
[leetcode]89. Gray Code -- JavaScript 代码原创 2016-09-07 16:31:11 · 723 阅读 · 0 评论 -
[leetcode]268. Missing Number -- JavaScript 代码
[leetcode]268. Missing Number -- JavaScript 代码原创 2016-08-15 11:27:51 · 625 阅读 · 0 评论 -
[leetcode]152. Maximum Product Subarray -- JavaScript 代码
[leetcode]152. Maximum Product Subarray -- JavaScript 代码原创 2016-08-26 15:24:20 · 673 阅读 · 0 评论 -
[leetcode]377. Combination Sum IV -- JavaScript 代码
[leetcode]377. Combination Sum IV -- JavaScript 代码原创 2016-09-05 15:15:29 · 631 阅读 · 0 评论 -
[leetcode]168. Excel Sheet Column Title -- JavaScript 代码
[leetcode]168. Excel Sheet Column Title -- JavaScript 代码原创 2016-08-22 10:22:10 · 526 阅读 · 0 评论 -
[leetcode]274. H-Index/275. H-Index II -- JavaScript 代码
[leetcode]274. H-Index/275. H-Index II -- JavaScript 代码原创 2016-08-10 11:19:25 · 512 阅读 · 0 评论 -
[leetcode]121. Best Time to Buy and Sell Stock -- JavaScript 代码
[leetcode]121. Best Time to Buy and Sell Stock -- JavaScript 代码原创 2016-08-21 09:58:52 · 490 阅读 · 0 评论 -
[leetcode]209. Minimum Size Subarray Sum -- JavaScript 代码
[leetcode]209. Minimum Size Subarray Sum -- JavaScript 代码原创 2016-08-29 11:11:53 · 676 阅读 · 0 评论 -
[leetcode]129. Sum Root to Leaf Numbers -- JavaScript 代码
[leetcode]129. Sum Root to Leaf Numbers -- JavaScript 代码原创 2016-08-29 09:44:40 · 553 阅读 · 0 评论 -
[leetcode]213. House Robber II -- JavaScript 代码
[leetcode]213. House Robber II -- JavaScript 代码原创 2016-08-17 17:23:24 · 496 阅读 · 0 评论 -
[leetcode]227. Basic Calculator II -- JavaScript 代码
[leetcode]227. Basic Calculator II -- JavaScript 代码原创 2016-08-17 16:33:30 · 660 阅读 · 0 评论 -
[leetcode]304. Range Sum Query 2D - Immutable -- JavaScript 代码
[leetcode]304. Range Sum Query 2D - Immutable -- JavaScript 代码原创 2016-08-05 14:37:13 · 442 阅读 · 0 评论 -
[leetcode]62. Unique Paths/63. Unique Paths II -- JavaScript 代码
[leetcode]62. Unique Paths/63. Unique Paths II -- JavaScript 代码原创 2016-08-16 22:02:19 · 606 阅读 · 0 评论 -
[leetcode]70. Climbing Stairs -- JavaScript 代码
[leetcode]70. Climbing Stairs -- JavaScript 代码原创 2016-08-16 17:14:45 · 598 阅读 · 0 评论 -
[leetcode]231. Power of Two/326. Power of Three -- JavaScript 代码
[leetcode]231. Power of Two/326. Power of Three -- JavaScript 代码原创 2016-08-16 13:00:03 · 452 阅读 · 0 评论 -
[leetcode]229. Majority Element II -- JavaScript 代码
[leetcode]229. Majority Element II -- JavaScript 代码原创 2016-08-16 11:00:52 · 479 阅读 · 0 评论 -
[leetcode]306. Additive Number -- JavaScript 代码
[leetcode]306. Additive Number -- JavaScript 代码原创 2016-08-04 10:46:05 · 523 阅读 · 0 评论