网易两种排序方法

xiaoxiao2021-02-27  182

#include<bits/stdc++.h> using namespace std; int main(){ int n; while(cin>>n) { vector<string>v; for(int i=0;i<n;i++) { string a; cin>>a; v.push_back(a); } int flag1=0,flag2=0; for(int i=1;i<n;i++) { if(v[i-1].size()>=v[i].size()) { flag1=1; break; } } for(int i=1;i<n;i++) { if(v[i-1]>=v[i]) { flag2=1; break; } } if(flag1==0&&flag2==0) cout<<"both"<<endl; else if(flag1==0) cout<<"lengths"<<endl; else if(flag2==0) cout<<"lexicographically"<<endl; else cout<<"none"<<endl; } return 0; }
转载请注明原文地址: https://www.6miu.com/read-15010.html

最新回复(0)