滑动窗口(模拟)
double findMaxAverage(int* nums, int numsSize, int k)
{
int sum = 0;
for(int i=0;i<k;i++)
{
sum+=nums[i];
}
int Max = sum;
for(int i =k;i<numsSize;i++)
{
sum = sum - nums[i - k] + nums[i];
if(sum>Max)
Max = sum;
}
return (double)(Max)/k;
}
1137. 第 N 个泰波那契数 - 力扣(LeetCode) (leetcode-cn.com)
//三个元素的维护
for(int i=0,j=1,m=3;m<=n;m++)
{
ret = a+b+c;
a = b;
b = c;
c = ret;//重点是将ret 赋值给k
}
70. 爬楼梯 - 力扣(LeetCode) (leetcode-cn.com)
//维护两个元素
for(int i=2;i<n;i++)
{
c += b;
b = c-b;
a = c-b;
}
976. 三角形的最大周长 - 力扣(LeetCode) (leetcode-cn.com)
[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-t6mJUSCr-1638861858337)(C:\Users\顾冷\AppData\Roaming\Typora\typora-user-images\image-20211128095236461.png)]
int cmp(const void *a, const void *b) {
return *(int *)a - *(int *)b;
}
int largestPerimeter(int* nums, int numsSize){
int i;
qsort(nums, numsSize, sizeof(int), cmp);
for(i = numsSize-1; i >= 2; --i) {
if(nums[i-2] + nums[i-1] > nums[i]) { // (1)
return nums[i-2] + nums[i-1] + nums[i];
}
}
return 0;
}