力扣 2055 --- 蜡烛之间的盘子

最新推荐文章于 2024-09-06 08:10:45 发布

呜拉拉的黑夜

最新推荐文章于 2024-09-06 08:10:45 发布

阅读量269

点赞数

文章标签： leetcode 算法排序算法

本文链接：https://blog.csdn.net/weixin_38376191/article/details/123509379

版权

力扣 2055 /// 蜡烛之间的盘子

地址: https://leetcode-cn.com/problems/plates-between-candles/
在这里插入图片描述
int* platesBetweenCandles(char * s, int** queries, int queriesSize, int* queriesColSize, int* returnSize){
int n = strlen(s);
int * preSum = (int )malloc(sizeof(int) * n);
memset(preSum, 0, sizeof(int) * n);
for (int i = 0, sum = 0; i < n; i++) {
if (s[i] == '’) {
sum++;
}
preSum[i] = sum;
}
int * left = (int *)malloc(sizeof(int) * n);
memset(left, 0, sizeof(int) * n);
for (int i = 0, l = -1; i < n; i++) {
if (s[i] == ‘|’) {
l = i;
}
left[i] = l;
}
int * right = (int *)malloc(sizeof(int) * n);
memset(right, 0, sizeof(int) * n);
for (int i = n - 1, r = -1; i >= 0; i–) {
if (s[i] == ‘|’) {
r = i;
}
right[i] = r;
}
int * ans = (int *)malloc(sizeof(int) * queriesSize);
for (int i = 0; i < queriesSize; i++) {
int x = right[queries[i][0]], y = left[queries[i][1]];
ans[i] = x == -1 || y == -1 || x >= y ? 0 : preSum[y] - preSum[x];
}
free(preSum);
free(left);
free(right);
*returnSize = queriesSize;
return ans;
}