题解 | #小乐乐走台阶#

#include<stdio.h>
int main()
{
    int arr[50] = { 0 };
    int n = 0;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }
    int ret = 0;
    scanf("%d", &ret);
    int k = 0;
    for (k = 0; k < n; k++)
    {
        if (arr[k] == ret)
        {
            for (int j = k; j < n - 1; j++)
            {
                arr[j] = arr[j + 1];
            }
            n--;找到了数组有效长度减一
            k--;让k别动
        }
     }
    for (int j = 0; j < n; j++)
    {
        printf("%d ", arr[j]);
    }
    return 0;
}