leetcode 3033. modify the matrix_leecode刷题 3033. 修改矩阵-爱代码爱编程
Leetcode 3033. Modify the Matrix 1. 解题思路2. 代码实现 题目链接：3033. Modify the Matrix 1. 解题思路 这一题是一道easy的题目，整体思路
leetcode 203 remove linked list elements (链表)-爱代码爱编程
Remove all elements from a linked list of integers that have value val. Example: Input: 1->2->6->3->4->5->6, val = 6 Output: 1->2->3->4->5 题目链接：
k-爱代码爱编程
问题描述： Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where
leetcode 404 sum of left leaves (dfs)-爱代码爱编程
Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 15 resp
longest uncommon subsequence i问题及解法-爱代码爱编程
问题描述： Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest s
longest continuous increasing subsequence 问题及解法-爱代码爱编程
问题描述： Given an unsorted array of integers, find the length of longest continuous increasing subsequence. 示例: Input: [1,3,5,4,7] Output: 3 Explanation: The longest continuo
leetcode 437 path sum iii (dfs)_leetcode 437 python-爱代码爱编程
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the root
detect capital问题及解法-爱代码爱编程
问题描述： Given a word, you need to judge whether the usage of capitals in it is right or not. We define the usage of capitals in a word to be right when one of the following case
relative ranks问题及解法_solution.findrelativeranks-爱代码爱编程
问题描述： Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze
reverse string ii问题及解法-爱代码爱编程
问题描述： Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characte
minimum absolute difference in bst问题及解法-爱代码爱编程
问题描述： Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. 示例： nput: 1 \ 3 / 2 Outp
perfect number问题及解法_perfect numbers程序填空题filter方法-爱代码爱编程
问题描述： We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself. Now, given an integer n, write a function tha
leetcode reverse integer-爱代码爱编程
Reverse Integer TotalAccepted: 73083 TotalSubmissions: 281068My Submissions Question Solution Reverse digits of an integer. Example1: x = 123,return 321 Example2: x = -123,
leetcode count and say-爱代码爱编程
Count and Say TotalAccepted: 42870 TotalSubmissions: 170242My Submissions Question Solution The count-and-say sequence isthe sequence of integers beginning as follows: 1, 11,
226. 翻转二叉树（python3）-爱代码爱编程
题目：力扣 翻转一棵二叉树。 示例： 输入： 4 / \ 2 7 / \ / \ 1 3 6 9 输出： 4 / \ 7 2 / \ / \ 9 6 3 1 代码： class Solution: def invertTree(self,
617. 合并二叉树（python3）-爱代码爱编程
题目：力扣 给定两个二叉树，想象当你将它们中的一个覆盖到另一个上时，两个二叉树的一些节点便会重叠。 你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠，那么将他们的值相加作为节点合并后的新值，否则不为 NULL 的节点将直接作为新二叉树的节点。 示例 1: 输入: Tree 1 Tree
543. 二叉树的直径（python3）-爱代码爱编程
题目：力扣 给定一棵二叉树，你需要计算它的直径长度。一棵二叉树的直径长度是任意两个结点路径长度中的最大值。这条路径可能穿过也可能不穿过根结点。 示例 : 给定二叉树 1 / \ 2 3 / \ 4 5 返回 3, 它的长度是路径 [4,2,1
461. 汉明距离（python3）-爱代码爱编程
题目：力扣 两个整数之间的 汉明距离 指的是这两个数字对应二进制位不同的位置的数目。 给你两个整数 x 和 y，计算并返回它们之间的汉明距离。 示例 1： 输入：x = 1, y = 4 输出：2 解释： 1 (0 0 0 1) 4 (0 1 0 0) ↑ ↑ 上面的箭头指出了对应二进制位不同的位置。 示例 2： 输
448. 找到所有数组中消失的数字（python3）-爱代码爱编程
题目：力扣 给你一个含 n 个整数的数组 nums ，其中 nums[i] 在区间 [1, n] 内。请你找出所有在 [1, n] 范围内但没有出现在 nums 中的数字，并以数组的形式返回结果。 示例 1： 输入：nums = [4,3,2,7,8,2,3,1] 输出：[5,6] 示例 2： 输入：nums = [1,1] 输出：[2]
338. 比特位计数（python3）-爱代码爱编程
题目：力扣 给你一个整数 n ，对于 0 <= i <= n 中的每个 i ，计算其二进制表示中 1 的个数 ，返回一个长度为 n + 1 的数组 ans 作为答案。 示例 1： 输入：n = 2 输出：[0,1,1] 解释： 0 --> 0 1 --> 1 2 --> 10 示例 2： 输入：n = 5 输出：[