最近在准备找工作的算法题,刷刷LeetCode,以下是我的解题报告索引,每一题几乎都有详细的说明,供各位码农参考。根据我自己做的进度持续更新中......                              本文地址

LeetCode:Reverse Words in a String

LeetCode:Evaluate Reverse Polish Notation

LeetCode:Max Points on a Line

LeetCode:Sort List

LeetCode:Insertion Sort List

LeetCode:LRU Cache

LeetCode:Binary Tree Postorder Traversal

LeetCode:Binary Tree Preorder Traversal

LeetCode:Reorder List

LeetCode:Linked List Cycle II

LeetCode:Linked List Cycle

LeetCode:Word Break II

LeetCode:Word Break

LeetCode:Copy List with Random Pointer

LeetCode:Single Number II

Leetcode:Single Number

LeetCode:Candy

LeetCode:Gas Station

LeetCode:Clone Graph

LeetCode:Palindrome Partitioning

LeetCode:Palindrome Partitioning II

LeetCode:Surrounded Regions

LeetCode:Sum Root to Leaf Numbers

LeetCode:Longest Consecutive Sequence

LeetCode:Word Ladder

LeetCode:Word Ladder II

LeetCode:Valid Palindrome

LeetCode:Binary Tree Maximum Path Sum

LeetCode:Best Time to Buy and Sell Stock

LeetCode:Best Time to Buy and Sell Stock II

LeetCode:Best Time to Buy and Sell Stock III

LeetCode:Triangle

LeetCode:Pascal's Triangle

LeetCode:Pascal's Triangle II

LeetCode:Populating Next Right Pointers in Each Node

LeetCode:Populating Next Right Pointers in Each Node II

LeetCode:Distinct Subsequences

LeetCode:Flatten Binary Tree to Linked List

LeetCode:Path Sum

LeetCode:Path Sum II

LeetCode:Minimum Depth of Binary Tree

LeetCode:Balanced Binary Tree

LeetCode:Convert Sorted List to Binary Search Tree

LeetCode:Convert Sorted Array to Binary Search Tree

LeetCode:Binary Tree Level Order Traversal II

LeetCode:Construct Binary Tree from Inorder and Postorder Traversal

LeetCode:Construct Binary Tree from Preorder and Inorder Traversal

LeetCode:Maximum Depth of Binary Tree

LeetCode:Binary Tree Zigzag Level Order Traversal

LeetCode:Binary Tree Level Order Traversal

LeetCode:Symmetric Tree

LeetCode:Same Tree

LeetCode:Recover Binary Search Tree

LeetCode:Validate Binary Search Tree

LeetCode:Interleaving String

LeetCode:Unique Binary Search Trees II

LeetCode:Unique Binary Search Trees

LeetCode:Binary Tree Inorder Traversal

LeetCode:Restore IP Addresses

LeetCode:Reverse Linked List II

LeetCode:Subsets II

LeetCode:Decode Ways

LeetCode:Gray Code

LeetCode:Merge Sorted Array

LeetCode:Scramble String

LeetCode:Partition List

LeetCode:Maximal Rectangle

LeetCode:Largest Rectangle in Histogram

LeetCode:Remove Duplicates from Sorted List II

LeetCode:Remove Duplicates from Sorted List

LeetCode:Search in Rotated Sorted Array II

LeetCode:Remove Duplicates from Sorted Array II

LeetCode:Word Search

LeetCode:Subsets

LeetCode:Combinations

LeetCode:Minimum Window Substring

LeetCode:Sort Colors

LeetCode:Search a 2D Matrix

LeetCode:Set Matrix Zeroes

LeetCode:Edit Distance

LeetCode:Simplify Path

LeetCode:Climbing Stairs

LeetCode:Sqrt(x)

LeetCode:Text Justification

LeetCode:Plus One

LeetCode:Valid Number

LeetCode:Add Binary

Leetcode:Merge Two Sorted Lists

LeetCode:Minimum Path Sum

LeetCode:Unique Paths II

LeetCode:Unique Paths

LeetCode:Rotate List

LeetCode:Permutation Sequence

LeetCode:Spiral Matrix II

LeetCode:Length of Last Word

LeetCode:Insert Interval

LeetCode:Merge Intervals

LeetCode:Jump Game

LeetCode:Spiral Matrix

LeetCode:Maximum Subarray

LeetCode:N-Queens II

LeetCode:N-Queens

LeetCode:Pow(x, n)

LeetCode:Anagrams

LeetCode:Rotate Image

LeetCode:Permutations II

LeetCode:Permutations

LeetCode:Jump Game II

LeetCode:Multiply Strings

LeetCode:First Missing Positive

LeetCode:Combination Sum II

LeetCode:Combination Sum

LeetCode:Count and Say

LeetCode:Sudoku Solver

LeetCode:Valid Sudoku

LeetCode:Search Insert Position

LeetCode:Search for a Range

LeetCode:Search in Rotated Sorted Array

LeetCode:Longest Valid Parentheses

LeetCode:Next Permutation

LeetCode:Divide Two Integers

LeetCode:Remove Element

LeetCode:Remove Duplicates from Sorted Array

LeetCode:Reverse Nodes in k-Group

LeetCode:Swap Nodes in Pairs

LeetCode:Merge k Sorted Lists

LeetCode:Generate Parentheses

LeetCode:Valid Parentheses

LeetCode:Remove Nth Node From End of List

LeetCode:Letter Combinations of a Phone Number

LeetCode:4Sum

LeetCode:3Sum Closest

LeetCode:3Sum

LeetCode:Roman to Integer

LeetCode:Integer to Roman

Leetcode:Palindrome Number

LeetCode:String to Integer (atoi)

LeetCode:Reverse Integer

LeetCode:ZigZag Conversion

LeetCode:Longest Palindromic Substring

LeetCode:Add Two Numbers

LeetCode:Longest Substring Without Repeating Characters

LeetCode:Median of Two Sorted Arrays

LeetCode:Two Sum

 
........持续更新中
【版权声明】转载请注明出处:http://www.cnblogs.com/TenosDoIt/p/3434579.html
 

LeetCode 解题报告索引的更多相关文章

  1. LeetCode解题报告:Linked List Cycle && Linked List Cycle II

    LeetCode解题报告:Linked List Cycle && Linked List Cycle II 1题目 Linked List Cycle Given a linked ...

  2. poj分类解题报告索引

    图论 图论解题报告索引 DFS poj1321 - 棋盘问题 poj1416 - Shredding Company poj2676 - Sudoku poj2488 - A Knight's Jou ...

  3. leetcode解题报告(2):Remove Duplicates from Sorted ArrayII

    描述 Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For ex ...

  4. LeetCode解题报告—— Longest Valid Parentheses

    Given a string containing just the characters '(' and ')', find the length of the longest valid (wel ...

  5. LeetCode解题报告—— Search in Rotated Sorted Array & Search for a Range & Valid Sudoku

    1. Search in Rotated Sorted Array Suppose an array sorted in ascending order is rotated(轮流,循环) at so ...

  6. LeetCode解题报告—— 2 Keys Keyboard & Longest Palindromic Substring & ZigZag Conversion

    1. Longest Palindromic Substring Given a string s, find the longest palindromic substring in s. You ...

  7. LeetCode解题报告—— 1-bit and 2-bit Characters & 132 Pattern & 3Sum

    1. 1-bit and 2-bit Characters We have two special characters. The first character can be represented ...

  8. leetCode解题报告5道题(六)

    题目一: Longest Substring Without Repeating Characters Given a string, find the length of the longest s ...

  9. LeetCode解题报告—— Interleaving String

    Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Input: s1 = ...

随机推荐

  1. lvm[12446]: Another thread is handling an event. Waiting

    在检查一Linux服务器时,发现日志里面有大量"lvm[12446]: Another thread is handling an event. Waiting..." Jul  ...

  2. 优化SQLServer——表和分区索引

    概念: 简单地说,分区是将大型的对象(如表)分成更小的且易于管理的小块.分区的基本单位是行,需要注意的是与分区视图不同的地方时,分区必须位于同一个数据库内. 分区的原因:            对于非 ...

  3. python基础(五)缩进和选择

    作者:Vamei 出处:http://www.cnblogs.com/vamei 欢迎转载,也请保留这段声明.谢谢! 缩进 Python最具特色的是用缩进来标明成块的代码.我下面以if选择结构来举例. ...

  4. 猜拳游戏GuessGame源码

    该游戏是一款比较不错的猜拳游戏GuessGame源码案例,GuessGame——猜拳游戏,这也是我自己的第一款休闲类的游戏案例,游戏实现也比较简单的,希望这个能够帮大家的学习和使用,更多安卓源码尽在源 ...

  5. 类似material design的电影应用源码

    这个源码应用是一款大家比较熟悉的类似material design的电影应用源码,源码Material-Movies,material design风格的电影应用,这个应用的目的其实是为了讲解作者一篇 ...

  6. 浅谈C++设计模式之单例模式

    单例模式:保证一个类仅有一个实例,并提供一个访问它的全局访问点. 通常我们可以让一个全局变量使得一个对象被访问,但它不能防止客户实例化多个对象,一个最好的办法就是让类自身负责保护它的唯一实例,这个类可 ...

  7. [Copy]Bird's booklist

    Copy from Bird Thanks! Here is his website: Bird's book list 0x01 编程语言 Python基础教程(第2版) Effective Jav ...

  8. Effective Java 读书笔记

    创建和销毁对象 >考虑用静态工厂方法替代构造器. 优点: ●优势在于有名称. ●不必再每次调用他们的时候都创建一个新的对象. ●可以返回原返回类型的任何子类型的对象. ●在创建参数化类型实例的时 ...

  9. CF687A. NP-Hard Problem[二分图判定]

    A. NP-Hard Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard ...

  10. IIS7.5中神秘的ApplicationPoolIdentity

    IIS7.5中(仅win7,win2008 SP2,win2008 R2支持),应用程序池的运行帐号,除了指定为LocalService,LocalSystem,NetWorkService这三种基本 ...