-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy path判断两个IP是否属于同一个子网.cpp
94 lines (84 loc) · 1.52 KB
/
判断两个IP是否属于同一个子网.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <iostream>
using namespace std;
void CharToInt(char* str, int* Int)
{
int i = 0, k = 0, temp = 0;
while (str[i] != '\0' && i < strlen(str))
{
while (str[i] != '.' && str[i] != '\0')
{
temp = temp * 10 + str[i] - '0';
i++;
}
Int[k++] = temp;
temp = 0; i++;
}
}
bool IpLegal(char* str)
{
if (str == NULL) return false;
int count = 0, i = 0;
char *p = str;
for (int i = 0; i < strlen(str); i++)
if (str[i] == '.' && str[i + 1] != '.')
count++;
char *p2 = str;
if (count == 3)
{
int k = 0, temp = 0, flag = 0;
for (int j = 0; j < 4; j++)
{
while (*p2 != '.' && *p2 != '\0')
{
if (*p2 >= '0' && *p2 <= '9')
{
temp = temp * 10 + *p2 - '0';
}
//else
//{
// cout << "NO1" << endl;
// break;
//}
++p2;
}
if (temp < 0 || temp > 255)
{
return false;
break;
}
else
flag++;
temp = 0; ++p2;
}
if (flag == 4)
return true;
}
else
return false;
}
char Solution(char* mask, char* ip1, char* ip2)
{
if (!IpLegal(mask) || !IpLegal(ip1) || !IpLegal(ip2))
return '1';
int maskArray[4], ip1Array[4], ip2Array[4];
CharToInt(mask, maskArray);
CharToInt(ip1, ip1Array);
CharToInt(ip2, ip2Array);
int temp1[4], temp2[4];
for (int i = 0; i < 4; i++)
{
temp1[i] = maskArray[i] & ip1Array[i];
temp2[i] = maskArray[i] & ip2Array[i];
if (temp1[i] != temp2[i])
return '2';
}
return '0';
}
void main()
{
char Mask[20], ip1[20], ip2[20];
cin >> Mask;
cin >> ip1;
cin >> ip2;
cout << Solution(Mask, ip1, ip2) << endl;
}