leetcode
文章平均质量分 94
Kevin__Mei
这个作者很懒,什么都没留下…
展开
-
二叉树的四种遍历算法_递归和迭代的实现
写在前面:二叉树的四种遍历方式,leetcode有对应的题目,题号为:94,102,144,145;大家看完可以去拿下这四道题;迭代算法参考学堂在线课程:清华-数据结构-邓俊晖老师;代码略做修改适应leetcode判题系统;二叉树的先序遍历:定义:如果二叉树为空,则返回,否则先访问根结点,然后先序遍历左子树,再先序遍历右子树;递归算法版本:// 根据定义很容易写出递归版本算法vector<int> preorderTraversal(TreeNode* root) { ve原创 2021-05-15 21:57:37 · 383 阅读 · 0 评论 -
15_3Sum 求三数之和
求三数之和给你一个包含 n 个整数的数组 nums,判断 nums 中是否存在三个元素 a,b,c ,使得 a + b + c = 0 ?请你找出所有满足条件且不重复的三元组。注意:答案中不可以包含重复的三元组。示例:给定数组 nums = [-1, 0, 1, 2, -1, -4],满足要求的三元组集合为:[[-1, 0, 1],[-1, -1, 2]]解题思路:如果是数组是有序的,则可以用双指针以线性时间复杂度来遍历所有满足题意得两个数组合;现对原数组进行排序 sort(num.转载 2020-06-12 13:44:29 · 193 阅读 · 0 评论 -
10_Regular Expression Matching 动态规划之正则表达
动态规划之正则表达本文转载于:https://github.com/labuladong/fucking-algorithm/blob/master/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E7%B3%BB%E5%88%97/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E4%B9%8B%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE.md自己加了C++部分的代码,还有些个人注释;正则表达式匹配是一个很精妙的算法,而转载 2020-06-06 16:04:12 · 370 阅读 · 0 评论 -
动态规划详解
动态规划动态规划问题的一般形式就是求最值。动态规划其实是运筹学的一种最优化方法,只不过在计算机问题上应用比较多,比如说让你求最长递增子序列呀,最小编辑距离呀等等。动态规划的穷举有特殊之处,这类问题存在[重叠子问题],如果包里穷举的话效率极其低下,所以需要[备忘录]或者[DP table]来优化穷举过程,避免不必要的计算。而且,动态规划问题一定会具备[最优子结构],才能通过子问题的最值得到原问题的最值;问题千变万化,穷举所有可行解并不是一件容易的事,只有列出正确的[状态转移方程]才能正确穷转载 2020-05-25 10:14:41 · 390 阅读 · 0 评论 -
126_Word Ladder ii
题目Given two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a timeEa...原创 2019-08-21 14:48:32 · 287 阅读 · 0 评论 -
129_sum root to leaf numbers
题目Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tot...原创 2019-08-12 13:35:43 · 123 阅读 · 0 评论 -
127_Word Ladder
题目Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at a ...原创 2019-08-15 14:28:35 · 113 阅读 · 0 评论 -
124_Binary Tree Maximum Path Sum
题目Given a non-empty binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connect...原创 2019-08-19 09:06:40 · 194 阅读 · 0 评论 -
131_Palindrome Partitioning
题目Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.Example:Input: “aab”Output:[[“aa”,“b”],[“a”,“a”...原创 2019-08-02 11:11:39 · 175 阅读 · 0 评论 -
132_Palindrome Partitioning ii
题目Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.Example:Input: “aab”Output: 1Exp...原创 2019-08-05 21:01:49 · 186 阅读 · 0 评论 -
136_Single Number
题目Given a non-empty array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it with...原创 2019-07-23 14:55:13 · 112 阅读 · 0 评论 -
142_Linked List Cycle II
题目Given a linked list, return the node where the cycle begins. If there is no cycle, return null.To represent a cycle in the given linked list, we use an integer pos which represents the position (0...原创 2019-07-17 09:38:48 · 119 阅读 · 0 评论 -
138_Copy List with Random Pointer
题目A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.Example 1:Input:{“KaTeX parse ...原创 2019-07-23 18:41:09 · 130 阅读 · 0 评论 -
88_Merge Sorted Array
题目Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note:The number of elements initialized in nums1 and nums2 are m and n respectively.You may assume tha...原创 2019-07-23 18:39:08 · 115 阅读 · 0 评论 -
139_Word Break
题目Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.Note:The...原创 2019-07-18 17:49:02 · 111 阅读 · 0 评论 -
151_Reverse Word in a String
题目Given an input string, reverse the string word by word.Example 1:Input: “the sky is blue”Output: “blue is sky the”Example 2:Input: " hello world! "Output: “world! hello”...原创 2019-07-11 09:53:56 · 177 阅读 · 0 评论 -
783_Minimum Distance Between BST
BST全称:binary Search Tree e左子树的结点的值 < 根节点的值 < 右子树的结点的值复习下数的遍历方式:中序遍历若二叉树的根节点为空,则直接返回,否则 从根节点开始(不是访问),先中序遍历左子树,再访问根节点,最后中序遍历右子树(参考大话数据结构,我觉得这句定义可以直接写递归了,非常实用到位)题目Given a Binary Search Tree (BST...原创 2019-07-13 14:26:12 · 205 阅读 · 0 评论