leetcode
文章平均质量分 62
Shit_Kingz
这个作者很懒,什么都没留下…
展开
-
Leetcode 136 level 1
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra mem...原创 2018-04-18 17:56:14 · 133 阅读 · 0 评论 -
LeetCode 13 level 0
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D 5...原创 2018-05-17 15:58:54 · 124 阅读 · 0 评论 -
Leetcode 21 level 0
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4Output: 1->1...原创 2018-05-17 14:50:35 · 160 阅读 · 0 评论 -
Leetcode 128 level 1
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.Your algorithm should run in O(n) complexity.Example:Input: [100, 4, 200, 1, 3, 2]Output: 4Explanati...原创 2018-05-10 00:48:20 · 161 阅读 · 0 评论 -
LeetCode 19 level 2
Given a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the li...原创 2018-05-09 23:33:18 · 143 阅读 · 0 评论 -
Leetcode 94 level 0
Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree [1,null,2,3], 1 \ 2 / 3return [1,3,2].Note: Recursive solution is trivial, could...原创 2018-04-18 21:32:06 · 159 阅读 · 0 评论 -
Leetcode 238 level 2
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n).F...原创 2018-04-18 19:04:47 · 147 阅读 · 0 评论 -
Leetcode 283 level 0
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your func...原创 2018-04-18 18:25:48 · 154 阅读 · 0 评论 -
Leetcode 104 level 0
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.For example:Given binary tree [3,9,20,null...原创 2018-04-18 17:22:50 · 140 阅读 · 0 评论 -
Leetcode 260 level 2
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given nums = [1,...原创 2018-05-07 12:49:40 · 142 阅读 · 0 评论