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 ...
随机推荐
- DSL-领域特定语言(英语:domain-specific language、DSL)
领域特定语言(英语:domain-specific language.DSL)指的是专注于某个应用程序领域的计算机语言.
- 使用TimeSpan对象获取时间间隔
实现效果: 关键知识: TimeSpan对象表是时间间隔或持续时间,两个DateTime对象相减,则会得到一个TimeSpan对象 使用其days ,hours,minutes等属性 实现代码: pr ...
- 2018.11.9 Dubbo入门学习
1.什么是Dubbo dubbo.io 代表是开源的 DUBBO是一个分布式服务框架,致力于提供高性能和透明化的RPC远程服务调用方案,是阿里巴巴SOA服务化治理方案的核心框架,每天为2,000+个服 ...
- 转载 【MySql】Update批量更新与批量更新多条记录的不同值实现方法
批量更新 mysql更新语句很简单,更新一条数据的某个字段,一般这样写: UPDATE mytable SET myfield = 'value' WHERE other_field = 'other ...
- [luoguP3627][APIO2009]抢掠计划
先来看一下题目描述: 题目描述 Siruseri 城中的道路都是单向的.不同的道路由路口连接.按照法律的规定, 在每个路口都设立了一个 Siruseri 银行的 ATM 取款机.令人奇怪的是,Siru ...
- phpstorm的主题相关
下载地址: http://phpstorm-themes.com/ 安装方法 JAR文件 导航->file->Import Settings->然后选择你刚才下载的JAR文件-> ...
- tracking
https://reid-mct.github.io/ 1st Workshop on Target Re-Identification and Multi-Target Multi-Camera ...
- html+css让网页自动适应手机屏幕
<meta name="viewport" content="width=device-width, initial-scale=1.0, minimum-scal ...
- Spring-Day02-依赖注入-作业
配置beans约束自动提示 spring-framework-4.2.4.RELEASE\docs\spring-framework-reference\html中打开xsd-configuratio ...
- sqlite内存数据库和文件数据库的同步[转]
由于sqlite对多进程操作支持效果不太理想,在项目中,为了避免频繁读写 文件数据库带来的性能损耗,我们可以采用操作sqlite内存数据库,并将内存数据库定时同步到文件数据库中的方法. 实现思路如下: ...