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. C++ GPU && CPU

    #include <amp.h> #include <iostream> #include <winbase.h> //操作系统的底层文件 using namesp ...

  2. mysql 数据导出 常用总结

    mysqldump -t 数据库名 -uroot -p > xxx.sql 总结:上面的导出形式默认表结构和数据: -d表结构; -t数据;   -c, --complete-insert使用完 ...

  3. Windows“神器”收集贴

    本文本来是刚开始发现autohotkey时比较兴奋,收集了几个autohotkey的介绍页面.最近又发现了win下多桌面的神器virtuawin,心想干脆在把本帖改成专门收集win下神器的帖子吧.如果 ...

  4. bzoj 3170: [Tjoi 2013]松鼠聚会

    #include<cstdio> #include<iostream> #include<algorithm> #define M 100008 using nam ...

  5. JAVA 泛型与通配符的使用

    泛型的本质是参数化类型.即所操作的数据类型被指定为一个参数. 1.jdk 1.5/1.6 必须显式的写出泛型的类型. 2.jdk 1.7/1.8 不必显式的写出泛型的类型. 一.泛型声明 可以用< ...

  6. fifo read

    #include <stdio.h> #include <stdlib.h> #include <string.h> #include <sys/types. ...

  7. 谷歌浏览器中安装.crx扩展名的离线Chrome插件

    一.本地拖放安装 1.下载扩展程序/脚本程序至本地计算机: 2.将其直接拖拽到浏览器的“扩展程序”(chrome://chrome/extensions/)页面. 二.解决“只能通过Chrome网上应 ...

  8. 性能测试报告的指标选择、数据选择和分析的参考【以Apache AB test为例】

    前几天尝试用loadrunner初试了一下性能测试,对于如何选择数据.生成数据后如何分析很是迷惑,刚刚翻看一篇网友的博客,很有条理,特此记录一下,以供参考 转自: http://liriguang.i ...

  9. Redis持久化-数据丢失及解决(转载)

    本文转载自        Redis持久化-数据丢失及解决  感谢原作者 Redis的数据回写机制 Redis的数据回写机制分同步和异步两种, 同步回写即SAVE命令,主进程直接向磁盘回写数据.在数据 ...

  10. Hibernate的many-to-many双向关联的配置办法

    <?xml version="1.0"?><!DOCTYPE hibernate-mapping PUBLIC "-//Hibernate/Hibern ...