一個數組中第一大數和第二大數
阿新 • • 發佈:2019-01-23
程式碼:
#include <iostream> using namespace std; int main() { int i, max1, max2; int len; cin >> len; int* arr = (int*)malloc(len*sizeof(int)); for (i = 0; i<len; i++) { cin >> arr[i]; } // char arr[] = { 1, 2, 4 ,8, 9, 7, 4, 2, 7, 0, 1 }; // int len = sizeof(arr); // cout << len << endl; if (arr[0] > arr[1]) { max1 = arr[0]; max2 = arr[1]; } else { max1 = arr[1]; max2 = arr[2]; } for (i = 2; i < len; i++) { if (arr[i]>max1) { max2 = max1; max1 = arr[i]; } else if (arr[i] > max2) max2 = arr[i]; } cout << max1 << endl; cout << max2 << endl; cin.get(); cin.get(); return 0; }