LeetCode
TimeMagician
这个作者很懒,什么都没留下…
展开
-
35. Search Insert Position-二分法while版
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.原创 2017-10-17 19:15:00 · 174 阅读 · 0 评论 -
136. Single Number
Given an array of integers, every element appears twice except for one. Find that single one.原创 2018-01-05 11:25:56 · 163 阅读 · 0 评论 -
477. Total Hamming Distance
利用对所有数的第i位求汉明距离,然后将32位的分别的汉明距离和相加得到答案。所有数的某一位的汉明距离可以用(含1的个数×不含1的个数)来求出。原创 2018-01-15 19:42:32 · 227 阅读 · 0 评论 -
454. 4Sum II
用空间换时间的典型例子原创 2018-01-15 22:02:25 · 250 阅读 · 0 评论 -
382. Linked List Random Node
对于大数据流的均等概率抽样问题可采用水塘抽样方法进行。即保留k个采样值时,当输入第i个数,保留这第i个数在采样样本中的概率为k/i。原创 2018-01-16 22:07:10 · 277 阅读 · 0 评论 -
226. Invert Binary Tree
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { publi原创 2018-01-08 20:20:36 · 179 阅读 · 0 评论 -
100. Same Tree
如何使用捕获异常Exception来中断递归操作。原创 2018-01-17 15:17:57 · 180 阅读 · 0 评论 -
3. Longest Substring Without Repeating Characters
用位操作实现环形队列的方法原创 2018-01-25 14:53:42 · 195 阅读 · 0 评论 -
384. Shuffle an Array
涉及到要把基本int类型的数组转换成list和把list转换成int[],但是在调用Arrays.asList()和List.toArray()方法时遇到了问题。值得注意的是这两个方法都是针对引用类型使用的,对于基本类型int,long,boolean等是存在问题的原创 2018-01-17 19:20:01 · 203 阅读 · 0 评论 -
387. First Unique Character in a String
我的方法采用了HashMap来储存集合,但是看了讨论后发现,对于已知种类数量的数据集合如26个字母,直接采用数组的形式储存是更好的方法。毕竟HashMap就是对未知集合进行标号方便查找。原创 2018-01-17 19:59:03 · 218 阅读 · 0 评论 -
530. Minimum Absolute Difference in BST
总结了二叉树的遍历方法。原创 2018-01-18 11:25:27 · 376 阅读 · 0 评论 -
22. Generate Parentheses——回溯法初探
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is:[ "((()))", "(()())", "(())()", "()...原创 2018-01-18 15:31:42 · 1469 阅读 · 1 评论 -
216. Combination Sum III——回溯法总结
回溯法总结原创 2018-01-19 17:35:23 · 509 阅读 · 0 评论 -
406. Queue Reconstruction by Height
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements that appear twice in this array.Could you do it without extra space原创 2018-01-05 10:44:50 · 238 阅读 · 0 评论 -
347. Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements. For example, Given [1,1,1,2,2,3] and k = 2, return [1,2].Note:You may assume k is always valid, 1 ≤ k ≤ number o原创 2018-01-14 15:51:06 · 239 阅读 · 0 评论 -
442. Find All Duplicates in an Array
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements that appear twice in this array.Could you do it without extra space原创 2018-01-04 10:44:42 · 201 阅读 · 0 评论 -
448. Find All Numbers Disappeared in an Array
开始同步练习LeetCode啦!原创 2017-09-22 11:28:22 · 214 阅读 · 0 评论 -
283. Move Zeroes
移零原创 2017-09-22 14:14:32 · 310 阅读 · 0 评论 -
169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.原创 2017-10-11 14:48:31 · 198 阅读 · 0 评论 -
75. Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue. Here, we will use the in原创 2017-12-19 17:12:51 · 181 阅读 · 0 评论 -
147. Insertion Sort List--单向链表移动
单向链表的插排原创 2017-12-20 10:03:41 · 192 阅读 · 0 评论 -
148. Sort List--单链表自顶向下归并排序
单向链表的自顶向上归并排序原创 2017-12-21 17:42:36 · 691 阅读 · 2 评论 -
324. Wiggle Sort II
波动排序原创 2017-12-23 16:15:31 · 313 阅读 · 0 评论 -
495. Teemo Attacking
In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attackingascending time series towards Ashe and the poisoning ti原创 2018-01-11 16:38:46 · 201 阅读 · 0 评论 -
258. Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r原创 2018-01-11 17:16:12 · 262 阅读 · 0 评论 -
451. Sort Characters By Frequency
Given a string, sort it in decreasing order based on the frequency of characters.原创 2018-01-11 20:08:01 · 231 阅读 · 0 评论 -
A summary: how to use bit manipulation to solve problems easily and efficiently
关于位操作的技巧,记录在此,以便时常翻看。转载 2018-01-11 21:21:46 · 238 阅读 · 0 评论 -
70. Climbing Stairs---组合C(m,n)的使用,注意int溢出!
C(m,n)的编写原创 2018-03-13 19:46:08 · 232 阅读 · 0 评论