程式語言 - LeetCode - C - 162. Find Peak Element



參考資訊:
https://algo.monster/liteproblems/162
https://www.cnblogs.com/grandyang/p/4217175.html

題目:


解答:

int findPeakElement(int *nums, int numsSize)
{
    int i = 0;
    int *q = calloc(numsSize + 2, sizeof(int));
 
    if (numsSize == 1) {
        return 0;
    }
 
    q[0] = INT_MIN;
    for (i = 0; i < numsSize; i++) {
        q[i + 1] = nums[i];
    }
    q[i + 1] = INT_MIN;
 
    for (i = 1; i < (numsSize + 1); i++) {
        if ((q[i] > q[i - 1]) && (q[i] > q[i + 1])) {
            return i - 1;
        }
    }
 
    return 0;
}