刘好念的博客

九坤-03. 数字默契考验 题解

本文介绍了一种求解LeetCode 5399的方法。通过模拟寻找十进制镜像数字，然后判断其对应的k进制表示是否也是镜像，直到统计得到n个镜像数字。

描述了一种使用bfs求解的算法。

一、题意You are given a strings containing lowercase letters and an integer k. You need to :First, change some characters of sto other lowercase English letters.Then divide sinto k non-empty disjo...

一、题意Given an array of integers, return the maximum sum for anon-emptysubarray (contiguous elements) with at most one element deletion.In other words, you want to choose a subarray and optionally ...

一、题意Given a string s, we make queries on substrings of s.For each query queries[i] = [left, right, k], we may rearrangethe substring s[left], ..., s[right], and then choose up to k of them to rep...

转载自:https://www.cnblogs.com/flightless/p/10745318.htmlclass Solution {public: static bool cmp(vector<int>a,vector<int>b) { return a[0]-a[1]<b[0]-b[1]; } int...

一、题意Given theheadof a linked list, we repeatedly delete consecutive sequences of nodes that sum to0until there are no such sequences.After doing so, return the head of the final linked list. ...

题目描述Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (well-formed) parentheses substring.样例Example 1:Input: “(()”Output: 2Explanation: The longest...

题目给定一个字符串 (s) 和一个字符模式 (p)。实现支持 '.' 和 '*' 的正则表达式匹配。'.' 匹配任意单个字符。'*' 匹配零个或多个前面的元素。匹配应该覆盖整个字符串 (s) ，而不是部分字符串。说明s 可能为空，且只包含从 a-z 的小写字母。 p 可能为空，且只包含从 a-z 的小写字母，以及字符 . 和 *。示例 输入:s = "aa"...

题目你有一个单词列表 words 和一个模式  pattern，你想知道 words 中的哪些单词与模式匹配。如果存在字母的排列 p ，使得将模式中的每个字母 x 替换为 p(x) 之后，我们就得到了所需的单词，那么单词与模式是匹配的。（回想一下，字母的排列是从字母到字母的双射：每个字母映射到另一个字母，没有两个字母映射到同一个字母。）返回 words 中与给定模式匹配的单词列表。...

题目描述: Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced wi...