编辑代码

#include <stdio.h>

int max(int a, int b) {
    return (a > b) ? a : b;
}

int maxCoinCollection(int coins[], int n) {
    if (n <= 0) return 0;
    
    int dp[n];
    dp[0] = coins[0];
    dp[1] = max(coins[0], coins[1]);

    for (int i = 2; i < n; i++) {
        dp[i] = max(dp[i-1], dp[i-2] + coins[i]);
    }

    return dp[n-1];
}

int main() {
    int coins[] = {1, 2, 3, 4, 5, 6};
    int n = sizeof(coins) / sizeof(coins[0]);

    printf("Maximum coin collection value: %d\n", maxCoinCollection(coins, n));

    return 0;
}