之前想边做题边写结题报告，发现有点力不从心，而且很多地方也是一知半解，现在重新做题，重新理解。这篇文章主要起一个目录的作用。
时间： 2024-11-05 11:27:10
[目录][Leetcode] Leetcode 题解索引
[目录][Leetcode] Leetcode 题解索引的相关文章
[LeetCode] Leetcode 题解索引 (C++/Java/Python/Sql)
全部最新的题解可以在 我的 github 上找,欢迎 star 和 watch ~ 更新中~~ 说明 这个系列的题解包括用 C++/Java/Python 写的 leetcode 上的算法题目,和 Sql 写的 leetcode 上的数据库题目. 有些题目虽然 AC 了却还没写分析,所以这次就开坑来完成. 链接: 我的 github Leetcode Algorithms Problems Leetcode Database Problems CSDN 题解索引 001.Two_Sum (Med
LeetCode: palindromes 题解
Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be palindromes? (ie, -1) If you are thinking of converting the integer to string, note the restriction of using extra space. You could also
LeetCode: LetterCombinations 题解
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit string "23" Output: ["ad", "ae", &q
LeetCode: plusOne 题解
Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. 题目大意: 给定一个由一组数字构成的数组表示的非负整数, 对这个数进行加一操作,并将结果数组返回. 数组的首元素存储的是该非负整数的最高位. 本题比较简
[leetcode] [leetcode] String to Integer (atoi)
Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases. Notes: It is intended for this problem to be spe
LeetCode题解索引
题目 类型 难度 1.两数之和 数组 简单 2.两数相加 链表.数学 中等 3.无重复字符的最长子串 hash.字符串 中等 4.两个数组的中位数 数组.二分 困难 5.最长回问子串 DP.字符串 中等 6.Z字变换 字符串.找规律 中等 7. 反转整数 数学 简单 8. 字符串转整数 (atoi) 数学.字符串 中等 9. 回文数 数学 简单 10.正则表达式匹配 字符串.回溯 困难 11. 盛最多水的容器 数组.双指针 中等 12. 整数转罗马数字 数学.字符串 中等 13. 罗马数字转整
【目录】Leetcode
不知不觉居然已经写了200多篇随笔了,现在查找的时候经常要翻好久,很不方便.故给自己做个目录~ Leetcode 1.动态规划 Palindrome Partitioning II(hard) ☆ Distinct Subsequences(hard) Edit Distance (hard) Interleaving String (hard) Regular Expression Matching (hard) ★ Wildcard Matching(hard) ★ 大神太牛了 Longes
LeetCode(100)题解--Same Tree
https://leetcode.com/problems/same-tree/ 题目: Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 思路: DFS AC代码: 1.递归 1
LeetCode(3)题解: Longest Palindromic Substring
https://leetcode.com/problems/longest-palindromic-substring/ 题目: Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. 思路: 我的思路是遍