数据结构算法——1005. 线性表的比较

题目

思路

字典序，比较长度，然后逐一比较内容大小

代码

#include<iostream>
using namespace std;

typedef int data;


int main()
{
    data a,b;
    cin >> a >> b;

    data*A = new data[a];
    data*B = new data[b];

    for(int i = 0; i < a; i++)
    cin >> A[i];
    for(int i = 0; i < b; i++)
    cin >> B[i];

    int flag;
    int times;

    if(a > b) {flag = 1; times = b;}
    else if(a < b) {flag = -1; times = a;}
    else {flag = 0; times = a;}

    for(int i = 0; i < times; i++)
    {
        if(A[i] < B[i])
        {
            cout << "-1";
            return 0;
        }
        else if(A[i] > B[i])
        {
            cout << "1";
            return 0;
        }
    }
    cout << flag ;
    return 0;
}