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. JavaWeb基础: XML基础知识

    简介 XML:可扩展标记语言,W3C指定的用于描述结构化数据的语言,XML在实际开发中,经常用作软件的配置文件,以描述程序模块之间的依赖和组合关系. XML约束:XML常常用于软件配置管理,对于软件框 ...

  2. WPF:ListView 分组合并

    CollectionViewSource 绑定的是从数据库取出的数据ListBind 以DeptName为分组依据 <Window.Resources> <CollectionVie ...

  3. sqlite数据类型

    sqlite数据类型(时间 日期 double等)     sqlite3支持的数据类型: NULL.INTEGER.REAL.TEXT.BLOB但是,sqlite3也支持如下的数据类型smallin ...

  4. 聚类clustering

    聚类:把相似的东西分到一组,是无监督学习. 聚类算法的分类: (1)基于划分聚类算法(partition clustering):建立数据的不同分割,然后用相同标准评价聚类结果.(比如最小化平方误差和 ...

  5. Mongodb异常关闭重启失败解决

    情况再现,连接mongodb的网站没有关,直接关闭了mongodb的cmd窗口.再次打开mongodb出现失败. 解决办法:网上说是删除 *.lock文件,再进行 --repair ,最后再打开mon ...

  6. MVC、ORM、CURD、ActiveRecord、单一入口的概念

    MVC MVC是一个设计模式,它强制性的使应用程序的输入.处理和输出分开.使用MVC应用程序被分成三个核心部件:模型(M).视图(V).控制器(C),它们各自处理自己的任务. 视图 :视图是用户看到并 ...

  7. 人脸识别SDK小结

    Face++人脸识别 进入官网 Face++ 致力于研发世界最好的人脸技术,提供免费的API和SDK供企业和开发者调用,更有灵活的定制化服务满足不同需求.已有多家公司使用Face++技术服务,完成包括 ...

  8. python3批量删除豆瓣分组下的好友

    python3批量删除豆瓣分组下的好友 """ python3批量删除豆瓣分组下的好友 2016年6月7日 03:43:42 codegay 我两年前一时冲动在豆瓣关注了 ...

  9. matplotlib画图保存

    import numpy as np import matplotlib.pyplot as plt xData = np.arange(0, 10, 1) yData1 = xData.__pow_ ...

  10. UE4 异步资源加载

    http://blog.csdn.net/pizi0475/article/details/48178861 http://blog.sina.com.cn/s/blog_710ea1400102vl ...