Problem Reason Reference
Moving Zeroes
Sort Colors
Corner cases  
Shortest Word Distance Thought: 2 ptr chasing  
Merge 2 sorted Lists
Remove Linked List Elem
Corner cases  
Power of Four Thought: fun bit ops  
Pow(x, n) int overflow  
Rectangle Area Thought  
Merge Sorted Array Thought: from the back  
Count Primes Corner cases  
First Bad Version Corner cases  
Rotate Array Thought: Multiple solutions  
Counting Bits Thought: Fun DP  
Top K Frequent Elements Thought: BUCKETING!  
Isomorphic Strings Thought: note - bidirectional  
Excel Sheet Column Title Thought: list first several cases  
Bulb Switcher Math\Brainteaser  
Word Pattern Corner case  
Majority Number Thought: counting strategy More thoughts
Add Digits Math, or by samples LC Forum
Power of 3 Math LC Forum
Factorial Trailing Zeros Math\counting  
Generate Parentheses DFS fun  
Longest Inc Path in Matrix DFS + Memorized Search  
Binary Tree Inorder Traversal DFS->Iterative LC Forum
Reverse Words in a String Note the copy trick! LC Forum
House Robber DP: fun !  
Paint Fence DP: fun !  
Binary Search Tree Iterator Stack\Iterator  
Count Numbers with Unique Digits Math: Combinatorics  
Combinations Note the backtracking one  
Min Stack Stack. Fun  
Integer Break DP, and Math  
strStr() *KMP algo.  

LeetCode Potential Thought Pitfalls的更多相关文章

  1. Potential Pythonic Pitfalls

    Potential Pythonic Pitfalls Monday, 11 May 2015 Table of Contents Not Knowing the Python Version Obs ...

  2. SPA UI-router

    ------------------------------------------------------------------------------------ SPA SPA(单页面应用): ...

  3. R数据分析:扫盲贴,什么是多重插补

    好多同学跑来问,用spss的时候使用多重插补的数据集,怎么选怎么用?是不是简单的选一个做分析?今天写写这个问题. 什么时候用多重插补 首先回顾下三种缺失机制或者叫缺失类型: 上面的内容之前写过,这儿就 ...

  4. LeetCode 548. Split Array with Equal Sum (分割数组使得子数组的和都相同)$

    Given an array with n integers, you need to find if there are triplets (i, j, k) which satisfies fol ...

  5. [LeetCode] Transform to Chessboard 转为棋盘

    An N x N board contains only 0s and 1s. In each move, you can swap any 2 rows with each other, or an ...

  6. [LeetCode] 687. Longest Univalue Path_Easy tag: DFS recursive

    Given a binary tree, find the length of the longest path where each node in the path has the same va ...

  7. Codewars, Leetcode, Hackerrank. Online Judges Reviews

    http://jasonjl.me/blog/2015/03/30/practical-programming-practice-services/ Codewars, Leetcode, Hacke ...

  8. 【leetcode 桶排序】Maximum Gap

    1.题目 Given an unsorted array, find the maximum difference between the successive elements in its sor ...

  9. The lesser known pitfalls of allowing file uploads on your website

    These days a lot of websites allow users to upload files, but many don’t know about the unknown pitf ...

随机推荐

  1. 在应用程序级别之外使用注册为 allowDefinition='MachineToApplication' 的节是错误的

    在MVC中添加授权认证配置之后报了这样的错 原因是在整个MVC项目中有两个Web.Config文件存在authentication节点,一个Web.Config文件在View目录下,一个在根目录下 解 ...

  2. [maven] maven变量

    Maven内置变量说明: $${project.basedir}或{basedir} 项目根目录,即包含pom.xml文件的目录 ${project.version}或${version}表示项目版本 ...

  3. css-九宫格自适应的实现

    高度自适应使用padding 或 padding-bottom + 百分比来实现: 宽度自适应使用width + 百分比来实现. 下面是实现九宫格自适应的代码: <!DOCTYPE html&g ...

  4. js输入,输出基本操作

  5. 【转】数据预处理之独热编码(One-Hot Encoding)

    原文链接:http://blog.csdn.net/dulingtingzi/article/details/51374487 问题由来 在很多机器学习任务中,特征并不总是连续值,而有可能是分类值. ...

  6. cmake gcc等安装备案

    cmake安装,参照 http://www.cnblogs.com/voyagflyer/p/5323748.html cmake2.8以上 安装后的是/usr/local/bin/cmake -ve ...

  7. iOS开发多线程篇—创建线程

    iOS开发多线程篇—创建线程 一.创建和启动线程简单说明 一个NSThread对象就代表一条线程 创建.启动线程 (1) NSThread *thread = [[NSThread alloc] in ...

  8. 计算机网络(5)-----ICMP协议和PING程序

    控制报文协议(Internet Control Message Protocol) 定义 它是TCP/IP协议族的一个子协议,用于在IP主机.路由器之间传递控制消息.控制消息是指网络通不通.主机是否可 ...

  9. UINavigationController导航控制器

    UINavigationController导航控制器,是多个界面间跳转的重要元素,可以理解为它存储着多个viewController,它的存储结构是栈,栈的特点是先进后出,所以添加视图控制器时,要特 ...

  10. 计算第k个质因数只能为3,5,7的数

    英文描述:Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7 思路: ...