当前位置:网站首页>Competition question 2022-6-26
Competition question 2022-6-26
2022-07-06 01:40:00 【Yake1965】
6104. Statistical asterisk
class Solution:
def countAsterisks(self, s: str) -> int:
return "".join(s.split("|")[::2]).count("*")
flag, ans = 1, 0
for c in s:
if c == "*": ans += flag
elif c == "|": flag = 1 - flag
return ans
a = s.split('|')
return sum(a[i].count("*") for i in range(0, len(a), 2))
6107. The number of different die sequences
The first i The result of throwing dice for the first time is affected by (i - 1) Time and number (i - 2) Limit of secondary results . So we maintain f(i, a, b) It means the first one i The result of this dice throw is a, The first (i - 1) The result of this time is b Number of alternatives .
In order to transfer , Let's enumerate the third (i - 2) Results of c. According to the meaning ,a,b,c The following requirements need to be met :
The three numbers are not equal to each other ;
gcd(a, b) = gcd(b, c) = 1.
As long as these two conditions are met at the same time ,f(i - 1, b, c) Can be transferred to f(i, a, b).
The first 300 Weekly match
2325. Decrypt the message
class Solution {
public String decodeMessage(String key, String message) {
Map<Character, Character> map = new HashMap<>();
int i = 97;
for(char c : key.toCharArray()){
if(c == ' ') continue;
if(!map.containsKey(c)) map.put(c, (char)(i++));
}
map.put(' ', ' ');
StringBuilder sb = new StringBuilder();
for(char c : message.toCharArray()){
sb.append(map.get(c));
}
return sb.toString();
}
}
2326. Spiral matrix IV
class Solution {
public int[][] spiralMatrix(int m, int n, ListNode head) {
int[][] ans = new int[m][n];
for(int[] row : ans) Arrays.fill(row, -1);
int up = 0, down = m - 1, left = 0, right = n - 1;
while(head != null){
for(int j = left; head != null && j <= right; j++){
ans[up][j] = head.val;
head = head.next;
}
up++;
for(int i = up; head != null && i <= down; i++){
ans[i][right] = head.val;
head = head.next;
}
right--;
for(int j = right; head != null && j >= left; j--){
ans[down][j] = head.val;
head = head.next;
}
down--;
for(int i = down; head != null && i >= up; i--){
ans[i][left] = head.val;
head = head.next;
}
left++;
}
return ans;
}
}
2327. Number of people who know the secret
f[i] It means the first one i Tianxin knows the number of Secrets .
class Solution {
public int peopleAwareOfSecret(int n, int delay, int forget) {
int mod = 1000000007;
long s = 0;
long[] f = new long[n + 1];
f[1] = 1;
for(int i = 2; i <= n; i++){
if(i > delay) s += f[i-delay];
if(i > forget) s -= f[i-forget];
f[i] = s % mod;
}
long sum = 0;
for(int i = 0; i < forget; i++){
sum = (sum + f[n - i]) % mod;
}
return (int)sum;
}
}
2328. The number of incremental paths in the grid graph
边栏推荐
- leetcode刷题_反转字符串中的元音字母
- Cadre du Paddle: aperçu du paddlelnp [bibliothèque de développement pour le traitement du langage naturel des rames volantes]
- 037 PHP login, registration, message, personal Center Design
- Basic operations of database and table ----- delete data table
- selenium 元素定位(2)
- Thinking about the best practice of dynamics 365 development collaboration
- [network attack and defense training exercises]
- yii中console方法调用,yii console定时任务
- 【SSRF-01】服务器端请求伪造漏洞原理及利用实例
- Force buckle 1020 Number of enclaves
猜你喜欢
[understanding of opportunity-39]: Guiguzi - Chapter 5 flying clamp - warning 2: there are six types of praise. Be careful to enjoy praise as fish enjoy bait.
General operation method of spot Silver
Yii console method call, Yii console scheduled task
Idea sets the default line break for global newly created files
Mathematical modeling learning from scratch (2): Tools
yii中console方法调用,yii console定时任务
Initialize MySQL database when docker container starts
Win10 add file extension
National intangible cultural heritage inheritor HD Wang's shadow digital collection of "Four Beauties" made an amazing debut!
Numpy array index slice
随机推荐
插卡4G工业路由器充电桩智能柜专网视频监控4G转以太网转WiFi有线网速测试 软硬件定制
Card 4G industrial router charging pile intelligent cabinet private network video monitoring 4G to Ethernet to WiFi wired network speed test software and hardware customization
leetcode-2.回文判断
You are using pip version 21.1.1; however, version 22.0.3 is available. You should consider upgradin
Cadre du Paddle: aperçu du paddlelnp [bibliothèque de développement pour le traitement du langage naturel des rames volantes]
2022 PMP project management examination agile knowledge points (8)
Ali test Open face test
02.Go语言开发环境配置
500 lines of code to understand the principle of mecached cache client driver
Idea sets the default line break for global newly created files
Comments on flowable source code (XXXV) timer activation process definition processor, process instance migration job processor
Spir - V premier aperçu
[solved] how to generate a beautiful static document description page
【已解决】如何生成漂亮的静态文档说明页
Redis-Key的操作
Flowable source code comments (36) process instance migration status job processor, BPMN history cleanup job processor, external worker task completion job processor
Leetcode1961. Check whether the string is an array prefix
Thinking about the best practice of dynamics 365 development collaboration
Folio. Ink is a free, fast and easy-to-use image sharing tool
Redis守护进程无法停止解决方案