2682 Problem H: New Feature in Windows 7

题意：给出n个字符串，按要求排序，要求如下：

If two filenames are same before certain position including start, the
order should be decided by these conditions:
a) If both of them are alphabets, the result depends on the alphabet order.
b) If one is alphabet and the other is number, the number is smaller.
c) If both of them are numbers, the result depends on number values.

例：

思路：学习了某位大神的sort排序..........

 

#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
const int N=110;

string str[N];

int dig(char c){return c>='0'&&c<='9';}
int ler(char c){return !dig(c);}

int cmp(string a,string b){
    int i,j,len_a,len_b;
    for(i=0;a[i]&&b[i];i++){
        if(dig(a[i])&&dig(b[i])){
            for(len_a=0,j=i;dig(a[j]);j++) len_a++;
            for(len_b=0,j=i;dig(b[j]);j++) len_b++;
            if(len_a<len_b) return 1;
            else if(len_a>len_b) return 0;
            else{
                for(int k=0;k<len_a;k++)
                    if(a[i+k]!=b[i+k]) return a[i+k]<b[i+k];
            }
            i=j;
        }
        else if(dig(a[i])&&ler(b[i])) return 1;
        else if(ler(a[i])&&dig(b[i])) return 0;
        else{
            if(a[i]!=b[i]) return a[i]<b[i]; 
        }
    }
    if(a[i]) return 0;
    return 1;
}

int main(){
    
//    freopen("data.in","r",stdin);
//    freopen("data.out","w",stdout);
    
    int n;
    while(scanf("%d",&n),n){
        for(int i=0;i<n;i++) cin>>str[i];
        sort(str,str+n,cmp);
        for(int i=0;i<n;i++) cout<<str[i]<<endl;
        cout<<endl;
    }
    return 0;
}