T1:100339. 找出加密后的字符串
思路:
字符串的循环左移,注意k的长度可能超过len(s),需要进行取余
代码
class Solution:
def getEncryptedString(self, s: str, k: int) -> str:
k = k%len(s)
return s[k:] + s[:k]
T2: 100328. 生成不含相邻零的二进制字符串
思路
找一下规律,0后只能跟1,1后可以跟0和1,也就是说
n = 1: ["0","1"]
n = 2: ["01"]+["10","11"] => ["01","10","11"]
n = 3: ["010","011"] + ["101"] + ["110","111"] => ["010","011","101","110","111"]
...
n = k: fun(k-1) + ["0","1"]
代码
from typing import List
class Solution:
def validStrings(self, n: int) -> List[str]:
def fun(n):
if n == 1:
return ["0","1"]
elif n == 2:
return ["01","10","11"]
else:
_list = fun(n-1)
ans = []
for item in _list:
if item[-1] == "0":
ans.append(item+"1")
else:
ans.append(item+"0")
ans.append(item+"1")
return ans
return fun(n)
T3: 100359. 统计 X 和 Y 频数相等的子矩阵数量
思路
题目中只有X Y .
三种字符,要求X和Y个数相同,考虑转化为数字的求和问题,把X和Y转成1和-1,把问题转化为求解累加和的问题。
这里的问题是:.
要转成什么数字的问题,题目要求至少含一个X,也就是说.
不能转0,否则不好区分。因此.根据数据范围可以转成2*106,因为全1全-1的情况下,累加和最多达到106。
因此解决思路就是先把X
、Y
,.
转成-1,1,2*106,判定条件是:设NUM=2*106,当sum%NUM==0 and sum!=(i+1)*(j+1)*NUM
时满足条件
ps:WR了两发,第一次是NUM只设置到2000,第二次是只用了一次前缀,没过后面的隐藏测试
例子
grid = [[“X”,“Y”,“.”],[“Y”,“.”,“.”]]
grid = [[-1, 1, 2000000], [1, 2000000, 2000000]]
前缀和:[[-1, 0, 2000000], [0, 2000001, 6000001]]
ans = 3 (0,2000000,0)
代码
from typing import List
class Solution:
def numberOfSubmatrices(self, grid: List[List[str]]) -> int:
NUM = 2*10**6
n = len(grid)
m = len(grid[0])
for i in range(n):
for j in range(m):
if grid[i][j] == "X":
grid[i][j] = -1
elif grid[i][j] == "Y":
grid[i][j] = 1
else:
grid[i][j] = NUM
pre = []
for i in range(n):
tmp = [grid[i][0]]
for j in range(1,m):
tmp.append(tmp[-1] + grid[i][j])
pre.append(tmp)
pre2 = []
for i in range(n):
if i == 0:
pre2.append(pre[0])
else:
tmp = []
for j in range(m):
tmp.append(pre2[i-1][j] + pre[i][j])
pre2.append(tmp)
ans = 0
for i in range(n):
for j in range(m):
res = pre2[i][j]
if res % NUM == 0 and res != NUM*(i+1)*(j+1):
ans += 1
return ans