每日一道算法题 输入整型数组和排序标识，对其元素按照升序或降序进行排序

题目

输入整型数组和排序标识，对其元素按照升序或降序进行排序_牛客题霸_牛客网 (nowcoder.com)

C语言

#include <stdio.h>


void fun_2024_6_19(void)
{
    int arr[1000];
    int flag;
    int count;
    scanf("%d",&count);
    for (int _ = 0; _ < count; _++)
    {
        scanf("%d", &arr[_]);
    }
    scanf("%d", &flag);

    for (int i = 0; i < count; i++)
    {
        for (int j = i + 1; j < count; j++)
        {
            if ((flag == 0 ? (arr[i] > arr[j]) : (arr[i] < arr[j])))
            {
                int tmp = arr[j];
                arr[j] = arr[i];
                arr[i] = tmp;
            }
        }
    }

    for (int _ = 0; _ < count; _++)
    {
        printf("%d ", arr[_]);
    }
}



int main() {
    fun_2024_6_19();
    return 0;
}

C++

#include <vector>
#include <iostream>
#include<algorithm>
#include <iterator>
using namespace std;

void fun_2024_6_19() {
    int count;
    cin >> count;
    vector<int> v;
    int num;
    for (int i = 0; i < count; i++) {
        cin >> num;
        v.push_back(num);
    }
    int flag;
    cin >> flag;
    if (flag == 0) {
        sort(v.begin(), v.end());
    } else if (flag == 1) {
        sort(v.rbegin(), v.rend());
    }
    //代替for循环打印数组
    copy(v.begin(), v.end(), ostream_iterator<int>(cout, " "));
    cout << endl;

}
int main() {

    fun_2024_6_19();
    return 0;
}

Python

def fun_2024_6_19():
    count=int(input())
    res=list(map(int,input().split(' ')))
    flag=int(input())
    res.sort()

    if not flag:
        for e in res:
            print(e,end=' ')
    else:
        res=res[::-1]
        for e in res:
            print(e,end=' ')

fun_2024_6_19()