题目如下: You are given two strings s and t of the same length. You want to change s to t. Changing the i-th character of s to i-th character of t costs |s[i] - t[i]| that is, the absolute difference between the ASCII values of the characters. You are al…

作者: 负雪明烛 id: fuxuemingzhu 公众号:每日算法题 本文关键词:LeetCode,力扣,算法,算法题,字符串,并查集,刷题群 目录 题目描述 示例 解题思路 滑动窗口 代码 刷题心得 欢迎加入组织 日期 题目地址:https://leetcode-cn.com/problems/get-equal-substrings-within-budget/ 题目描述 给你两个长度相同的字符串, s 和 t . 将 s 中的第 i 个字符变到 t 中的第 i 个字符需要 |s[i] -…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 方法一:暴力解法(TLE) 方法二:连续子串计算 日期 题目地址:https://leetcode.com/problems/baseball-game/description/ 题目描述 Give a string s, count the number of non-empty (contiguous) substrings that have…

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 DFS 动态规划 日期 题目地址:https://leetcode.com/problems/partition-equal-subset-sum/description/ 题目描述 Given a non-empty array containing only positive integers, find if the array can be…

题目如下: Given an array A of 0s and 1s, divide the array into 3 non-empty parts such that all of these parts represent the same binary value. If it is possible, return any [i, j] with i+1 < j, such that: A[0], A[1], ..., A[i] is the first part; A[i+1],…

题目如下: Given an array nums of positive integers, return the longest possible length of an array prefix of nums, such that it is possible to remove exactly one element from this prefix so that every number that has appeared in it will have the same num…

题目如下: 解题思路:对于这种判断是否的题目,首先看看动态规划能不能解决.本题可以看成是从nums中任选i个元素,判断其和是否为sum(nums)/2,很显然从nums中任选i个元素的和的取值范围是[0,sum(nums)],这里就可以用一个dp数组来保存nums中任选i个元素的和的取值的和,记dp[v] = 1表示可以从nums中任选i个元素使得其和等于v,dp[v] = 0 则表示不可以.那么nums中任意元素nums[i]来说,只要找出dp[0,sum(nums[0:i-1])] 中所有为…

[LeetCode]647. Palindromic Substrings 解题报告(Python) 标签: LeetCode 题目地址:https://leetcode.com/problems/palindromic-substrings/description/ 题目描述: Given a string, your task is to count how many palindromic substrings in this string. The substrings with dif…

题目如下: 解题思路:本题是[leetcode]473. Matchsticks to Square的姊妹篇,唯一的区别是[leetcode]473. Matchsticks to Square指定了分成四个子数组,而本题分成的份数不定,作为参数输入.另外,本题的测试用例好像复杂一点,因此我过滤掉了nums中值等于avg的元素,不参与后面的DFS计算,提高效率. 代码如下: class Solution(object): def canPartitionKSubsets(self, nums,…

题目如下: Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a number, that number will not be available f…