Solution to LeetCode Problem Set
Here is my collection of solutions to leetcode problems.
Related code can be found in this repo: https://github.com/zhuli19901106/leetcode
LeetCode - Reverse Linked List
LeetCode - Remove Linked List Elements
LeetCode - Bitwise AND of Numbers Range
LeetCode - Binary Tree Right Side View
LeetCode - Best Time to Buy and Sell Stock IV
LeetCode - Repeated DNA Sequences
LeetCode - Binary Search Tree Iterator
LeetCode - Factorial Trailing Zeroes
LeetCode - Excel Sheet Column Number
LeetCode - Excel Sheet Column Title
LeetCode - Fraction to Recurring Decimal
LeetCode - Compare Version Numbers
LeetCode - Intersection of Two Linked Lists
LeetCode - Find Minimum in Rotated Sorted Array II
LeetCode - Find Minimum in Rotated Sorted Array
LeetCode - Reverse Words in a String
LeetCode - Regular Expression Matching
LeetCode - Substring with Concatenation of All Words
LeetCode - Reverse Nodes in k-Group
LeetCode - Palindrome Partitioning II
LeetCode - Palindrome Partitioning
LeetCode - Minimum Window Substring
LeetCode - Max Points on a Line
LeetCode - Largest Rectangle in Histogram
LeetCode - Interleaving String
LeetCode - Evaluate Reverse Polish Notation
LeetCode - Longest Valid Parentheses
LeetCode - Flatten Binary Tree to Linked List
LeetCode - Convert Sorted List to Binary Search Tree
LeetCode - Binary Tree Maximum Path Sum
LeetCode - Trapping Rain Water
LeetCode - Unique Binary Search Trees II
LeetCode - String to Integer (atoi)
LeetCode - Longest Palindromic Substring
LeetCode - Permutation Sequence
LeetCode - First Missing Positive
LeetCode - Distinct Subsequences
LeetCode - Container With Most Water
LeetCode - Insertion Sort List
LeetCode - Binary Tree Postorder Traversal
LeetCode - Binary Tree Preorder Traversal
LeetCode - Linked List Cycle II
LeetCode - Copy List with Random Pointer
LeetCode - Sum Root to Leaf Numbers
LeetCode - Longest Consecutive Sequence
LeetCode - Best Time to Buy and Sell Stock III
LeetCode - Best Time to Buy and Sell Stock II
LeetCode - Best Time to Buy and Sell Stock
LeetCode - Pascal's Triangle II
LeetCode - Populating Next Right Pointers in Each Node II
LeetCode - Populating Next Right Pointers in Each Node
LeetCode - Minimum Depth of Binary Tree
LeetCode - Balanced Binary 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 - Recover Binary Search Tree
LeetCode - Validate Binary Search Tree
LeetCode - Unique Binary Search Trees
LeetCode - Binary Tree Inorder Traversal
LeetCode - Restore IP Addresses
LeetCode - Reverse Linked List II
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 - Merge Two Sorted Lists
LeetCode - Length of Last Word
LeetCode - Search Insert Position
LeetCode - Search in Rotated Sorted Array
LeetCode - Divide Two Integers
LeetCode - Remove Duplicates from Sorted Array
LeetCode - Swap Nodes in Pairs
LeetCode - Merge k Sorted Lists
LeetCode - Generate Parentheses
LeetCode - Remove Nth Node From End of List
LeetCode - Letter Combinations of a Phone Number
LeetCode - Longest Common Prefix
LeetCode - Longest Substring Without Repeating Characters
LeetCode - Median of Two Sorted Arrays
Solution to LeetCode Problem Set的更多相关文章
- LeetCode Problem 90. Subsets II
python solution 123456789101112131415161718192021222324252627 class (object): def subsetsWithDup(sel ...
- an optimal solution to the problem
http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Greedy/greedyIntro.htm Greedy Introdu ...
- leetcode problem 42 -- Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, comput ...
- leetcode problem (5) Longest Palindromic Substring
最长回文子串: 1. 暴力搜索 时间复杂度O(n^3) 2. 动态规划 dp[i][j] 表示子串s[i…j]是否是回文 初始化:dp[i][i] = true (0 <= i <= ...
- leetcode problem (2-4)
Problem 2 --- Add Two Numbers 简单的模拟题. Problem 3 --- Longest Substring Without Repeating Characters 题 ...
- LeetCode Problem 2:Two Sum
描述: Given an array of integers, find two numbers such that they add up to a specific target number. ...
- LeetCode Problem 9:Palindrome Number回文数
描述:Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could nega ...
- LeetCode Problem 169: Majority Element查找多数元素
描述:Given an array of size n, find the majority element. The majority element is the element that app ...
- 【436】Solution for LeetCode Problems
Coding everyday. ^_^ 1. Two Sum 重点知识:指针可以存储数值,通过 malloc 新建数组 int* returnSize:Size of the return arra ...
随机推荐
- SSD 从形式到实质之改变
SSD 从形式到实质之改变 作者:廖恒 SSD的物理尺寸之混战正在进行其中. 数据中心的硬件架构师由于要规划下一代server的机械设计.还要制定JBOD的设计规范,想必面临不少困 ...
- MySQL:数据库入门篇3
1.sql语句逻辑执行顺序 (7) SELECT (8) DISTINCT <select_list> (1) FROM <left_table> (3) <join_t ...
- cftool拟合&函数逼近
cftool拟合&函数逼近 cftool 真是神奇,之前我们搞的一些线性拟合解方程,多项式拟合,函数拟合求参数啊,等等. 已经超级多了,为啥还得搞一个cftool拟合啊?而且毫无数学理论. 如 ...
- 2014-2015 ACM-ICPC East Central North America Regional Contest (ECNA 2014) A、Continued Fractions 【模拟连分数】
任意门:http://codeforces.com/gym/100641/attachments Con + tin/(ued + Frac/tions) Time Limit: 3000/1000 ...
- FreeImage.lib库的配置和简单使用 转
转载地址 http://www.codeweblog.com/win8-1%E4%B8%8Bfreeimage-lib%E5%BA%93%E7%9A%84%E9%85%8D%E7%BD%AE%E5%9 ...
- hadoop二次排序
import java.io.DataInput; import java.io.DataOutput; import java.io.File; import java.io.IOException ...
- TensorFlow安装环境的误区
安装py一定要注意安装的版本,我一开始安装的3.7版本的,现在还没有支持,另外,看清楚自己电脑是32位还是64位的
- docker官方文档翻译3
转载请标明出处: https://blog.csdn.net/forezp/article/details/80171723 本文出自方志朋的博客 第三部分: 服务 准备工作 安装Docker 1.1 ...
- java.util.ArrayList,java.util.LinkedList,java.util.Vector的区别,使用场合.
下图是Collection的类继承图 从图中可以看出:Vector.ArrayList.LinkedList这三者都实现了List 接口.所有使用方式也很相似,主要区别在于实现方式的不同,所以对不同的 ...
- 一个BUG?Visual Studio 2017 C++编写交换两个整数
想用一句话搞定交换: int a = 2, b = 5; cout << "a = " << a << ", b = " & ...