Lintcode_solution
Overview
Lintcode/Leetcode
- Binary Search
  - First Position of Target
  - First Bad Version
  - Search in a Big Sorted Array
  - Find Minimum in Rotated Sorted Array
  - Sqrt(x)
  - Wood Cut
  - Copy Books
  - Closest Number in Sorted Array
  - Search a 2D Matrix
  - Maximum Number in Mountain Sequence
  - Divide Two Integers
  - First Bad Version
  - Search a 2D Matrix II
  - Smallest Rectangle Enclosing Black Pixels
- Binary Tree & Divide Conquer
- DFS
- Two Pointer
  - Quick Sort
  - Kth Largest Element
  - Quick Select
  - Two Sum
  - Three Sum
  - Four Sum
  - Three Sum Closeted
  - Remove Duplicates from Sorted Array I
  - Remove Duplicates from Sorted Array II
- Linked List
- O(1) Check Power of 2
- Data Structure
- Topological Sorting
- Follwer Up
  - Minimum Window Substring
- 1-100
  - Digit Counts
  - Ugly Number II
  - Trailing Zeros
  - A + B Problem ?
  - Kth Largest Element
  - Merge Two Sorted Arrays
  - Binary Tree Serialization (TBD)
  - Rotate String
  - Fizz Buzz
  - String Permutation II
  - Min Stack
  - Search Range in Binary Search Tree
  - strSTR
  - First Position of Target
  - Permutations
  - Permutations II
  - Subsets
  - Subsets II
  - Dices Sum TBD
  - Search a 2D Matrix
  - Interleaving String （TBD)
  - Insert Interval (TBD)
  - Minimum Window Substring
  - Partition Array
  - N-QUEEN
  - N-QUEEN 2 (TBD)
  - Reverse Linked List
  - Reverse Linked List II
  - Search a 2D Matrix II
  - Recover Rotated Sorted Array
  - Implement Queue by Two Stacks
  - Maximum Subarray
  - Single Number
  - Next Permutation 31
  - Gray Code
  - 101-200
    - Insertion Sort List
    - Pascal's Triangle
  - 400-500
    - Pow(x, n)
- SubArray
  - Subarray Sum
- Tree
- EDA
  - 问题
    - C++ interview
- C++ 问题
  - C++ Interview
  - Copy Constructor in C++
- Graph
- Dynamic Programming
  - Longest Palindromic Substring
- 位运算
- 300-400
  - Top K Frequent Elements
Leetcode
- Rotate Array
FLAG面试题
CC150
- Arrays and Strings
- Chapter2 Linked List
  - Write code to remove duplicates from an unsorted linked list
  - Implement an algorithm to find the kth to last element of a singly linked list.
人工智能-机器学习
DeepLearning.ai 课
C++ 基础知识
虚函数与多态
封装与继承
C++问题
Python 知识
c++基础
Data Structure
Heap
Database准备
Database准备介绍
面试准备工作
每天更新
TO DO LIST
一套完整的学习手册帮助面试
面试准备工作
软件面试需要准备的知识
面经考古
面经总结2016
前期准备
MapReduce
多线程
Design Pattern
- 单例模式
Behavior Question
- 亚马逊bq
Amazon 社招 OA
系统设计
Behavior Question
ood
别人的刷题经验
刷题笔记
小土刀的面试刷题笔记
共享笔记
微软
面试公司
别人的面试公司
别人的刷题总结
链表题目
快速刷题口诀
system design 总结
Bitset
Methods
Defining Methods

Powered by GitBook

Dummy Node

C++用dummy 不delete的方法：

listNode dummy

dummy.next = head;

//

return dummy.next

results matching ""

No results matching ""