滴滴算法笔试第一题（一目了然）

#include<iostream>
#include<cstdio>
#include<vector>
#include<string.h>

using namespace std;

bool tureOrFalse(char a, char b, char c)
{
    if (b == '+' && a == '+' && (c == '+' || c == '-'))
        return true;
    else if (b == '-' && a == '-' && (c == '+' || c == '-'))
        return true;
    else if (b == '*' && a != '/')
        return true;
    else if (b == '/' && a == '/')
        return true;
    else
        return false;
}

int main()
{
    int n = 0;

    cin >> n;
//6 3+2+1+-4*-5+1
    vector <int> s(n, 0);
    vector <char> f(n + 1, '+');


    for (int i = 1; i < n + n; i++)
    {
        if (i % 2 == 0)
            cin >>f[i / 2];
        else
            cin >> s[(i - 1) / 2];
    }

    cout << "输出s数组：" << endl;
    for (int i = 0; i < s.size(); i++) {
        cout << s[i] << endl;
    }
    cout << "输出f数组：" << endl;
    for (int i = 0; i < f.size(); i++) {
        cout << f[i] << endl;
    }

    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j < n - i - 1; j++)
        {
            if (s[j] >s[j + 1] && tureOrFalse(f[j], f[j + 1], f[j + 2])) {
                int temp = s[j];
                s[j] = s[j + 1];
                s[j + 1] = temp;
            }
        }
    }
    for (int i = 0; i < n; i++)
    {
        cout << s[i] << " ";
        if (i < n - 1)
            cout << f[i + 1] << " ";
    }
    cout << endl;
    system("pause");
    return 0;
#滴滴##笔试题目##题解#