Skip to content

leetcode 题库解析和 Java 实例代码

Notifications You must be signed in to change notification settings

Hermoins/leetcode

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

leetcode 算法题解(Java语言)

本项目是本人在 leetcode 学习算法时代码的保留副本。以下的各个问题的示例代码中包含了简单解决思路。

问题分类:

动态规划

视频教程,一个UP做的,比较基础,但是讲的很好:

动态规划问题列表:

已解决问题

1. Two Sum(两数之和)

7. Reverse Integer(反转整数数字)

9. Palindrome Number(回文数字)

13. Roman to Integer(罗马数字转整数)

14. Longest Common Prefix(最长公共前缀)

20. Valid Parentheses

21. Merge Two Sorted Lists

26. Remove Duplicates from Sorted Array

28. 实现strStr()

35. 搜索插入位置.java

53. 最大子序和.java

58. Length of Last Word

88. Merge Sorted Array

112. Path Sum(判断二叉树是否存在一条从根节点到叶子节点的路径,并且这条路径加起来等于给定的参数 sum)

125. Valid Palindrome

155. Min Stack

198. House Robber

290. Word Pattern

344. Reverse String(反转字符串)

389. Find the Difference

559. Maximum Depth of N-ary Tree

575. Distribute Candies

589. N-ary Tree Preorder Traversal N叉树前序遍历

590. N-ary Tree Postorder Traversal

617. Merge Two Binary Trees

690. Employee Importance

700. Search in a Binary Search Tree

739. Daily Temperatures 每日温度

771. Jewels and Stones 宝石和石头

781. Rabbits in Forest

860. Lemonade Change 柠檬水找零

905. Sort Array By Parity 按奇偶排序数组

953. Verifying an Alien Dictionary 验证外星语词典

About

leetcode 题库解析和 Java 实例代码

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%