上次有人在吧里提到黑洞数字，自己就实现了寻找黑洞数的程序

只找到了两个
#include<iostream>
#include<string>
#include <vector>
#include<algorithm>
using namespace std;
int memory[111111111];// memory[i] 表示数字i的终点
vector<int> blackHoleNumber;
bool cmp(int x, int y) {
return x > y;
}
void BreakNumber(vector<int>& digits,int x) {
while (x) {
digits.push_back(x % 10);
x /= 10;
}
}
void ArrageNumber(int x,int& _max,int& _min) {
_max = 0;
_min = 0;
vector<int> digits;
BreakNumber(digits, x);
sort(digits.begin(), digits.end(), cmp);
for (int i = 0; i < digits.size(); i++) {
_max += digits[i];
if(digits.size()!=i+1)
_max *= 10;
}
if (digits.size()&&digits[digits.size() - 1] == 0) {
for (int i = digits.size() - 2; i >= 0; i--) {
if (digits[i] != 0) {
swap(digits[i], digits[digits.size() - 1]);
break;
}
}
}
for (int i = digits.size() - 1; i >= 0; i--) {
_min += digits[i];
if (i - 1 != -1)
_min *= 10;
}
}
bool Check(int x, int y) {
vector<int> vecx;
vector<int> vecy;
BreakNumber(vecx, x);
BreakNumber(vecy, y);
sort(vecx.begin(), vecx.end(),cmp);
if (vecx.size() != vecy.size())
return false;
for (int i = 0; i < vecx.size() && i < vecy.size();i++) {
if (vecx[i] != vecy[i])
return false;
}
return true;
}
bool visit[11111111];
int dfs(int x) {
int res;
int _max;
int _min;
int sub;
ArrageNumber(x, _max, _min);
sub = _max - _min;
if (visit[_min])
return memory[_min];
visit[_min] = visit[_max] = visit[sub] = visit[x] = true;
if (Check(sub,_min)) {
blackHoleNumber.push_back(sub);
return memory[x] = memory[sub] = memory[_max] = memory[_min] =sub;
}
else if (memory[sub] == -1) {
return memory[x] = memory[sub] = memory[_max] = memory[_min] = dfs(sub);
}
else
return memory[sub];
}
int main() {
for (int i = 0; i < 1111111; i++) {
memory[i] = -1;
}
for (int i = 1; i < 11111; i++) {
dfs(i);
}
for (int i = 0; i < blackHoleNumber.size(); i++) {
cout << blackHoleNumber[i];
if (i + 1 == blackHoleNumber.size())
cout << '\n';
else
cout << " ";
}
return 0;
}