寻找连通线,参考八后算法递归,可用于验证码去除连续干扰线

 #include <iostream> using namespace std; #define M 5 #define N 4 int a[M][N] = {0,1,0,1,0,1,1,0,1,1,0,0,1,0,1,0,1,0,1,0}; int b[M] = {}; void genLine(int n) { if (n == M) { for (int i = 0; i < M

>>阅读原文<<