摘要: https://leetcode.cn/problems/is-subsequence/description/ class Solution { public boolean isSubsequence(String s, String t) { // 依据题意,可以判断是求最长公共子序列的特殊情 阅读全文
posted @ 2024-09-08 14:08 风乐 阅读(10) 评论(0) 推荐(0)
摘要: https://leetcode.cn/problems/maximum-subarray/description/ class Solution { public int maxSubArray(int[] nums) { // f[i]表示以第i个数为结尾的最大连续子数组和 // 以是否选择第i 阅读全文
posted @ 2024-09-08 02:22 风乐 阅读(15) 评论(0) 推荐(0)
摘要: https://leetcode.cn/problems/uncrossed-lines/ class Solution { public int maxUncrossedLines(int[] nums1, int[] nums2) { // 依据题意,稍加思考可知,是求最长公共子序列 // f[ 阅读全文
posted @ 2024-09-08 02:08 风乐 阅读(14) 评论(0) 推荐(0)