Programación orientada a objetos C ++ 035: Ordenar por distancia ---- (Beijing University Mooc)

---

Enlace de blog especial

Blog de ejercicios después de la clase de C ++ POJ de la Universidad de Pekín Registro completo de soluciones

---

Titulo original

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
template <class T1,class T2>
struct Closer {
    
    
// 在此处补充你的代码
};

int Distance1(int n1,int n2) {
    
    
	return abs(n1-n2);
}
int Distance2(const string & s1, const string & s2)
{
    
    
	return abs((int)s1.length()- (int) s2.length());
}
int a[10] = {
    
     0,3,1,4,7,9,20,8,10,15};
string b[6] = {
    
    "American","Jack","To","Peking","abcdefghijklmnop","123456789"};
int main()
{
    
    
	int n;string s;
	while( cin >> n >> s ) {
    
    
		sort(a,a+10,Closer<int ,int (*)(int ,int)> (n,Distance1));
		for(int i = 0;i < 10; ++i)
			cout << a[i] << "," ;
		cout << endl;
		sort(b,b+6,Closer<string,int (*)(const string &,const string &  )> (s,Distance2)); 
		for(int i = 0;i < 6; ++i)
			cout << b[i] << "," ;
		cout << endl;
	}
	return 0;
}

---

Código

private:
    T1  n;
    T2 func;
public:
    Closer(T1 n1,T2 func1):n(n1),func(func1){
    
    }
    bool operator ()(const T1& n1,const T1 & n2)
    {
    
    
        int judge1 = func(n1,n);
        int judge2 = func(n2,n);
        if(judge1 < judge2 || (judge1 == judge2 && n1 < n2)) return true;
        else   return false;
    }