尋找陣列中的最大值和次大值
阿新 • • 發佈:2021-02-15
技術標籤:# 演算法題
#include<stdio.h> int main() { int A[7] = { 1,2,3,4,5,6 }; printf("陣列:"); for (int i = 0; i < 6; i++) printf("%d ", A[i]); printf("\n"); int one = (A[0] > A[1]) ? A[0] : A[1]; //one是最大值 int two = (A[0] < A[1]) ? A[0] : A[1]; //two是次大值 for (int i = 2; i < 6; i++) { if (A[i] > one) { two = one; one = A[i]; } else if(A[i] < two) { continue; } else { two = A[i]; } } printf("最大值:%d\n", one); printf("次大值:%d\n", two); return 0; }