-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathClassSet.cs
More file actions
140 lines (122 loc) · 3.39 KB
/
ClassSet.cs
File metadata and controls
140 lines (122 loc) · 3.39 KB
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
using System;
using System.Collections.Generic;
namespace lab3OneMoreTime
{
public class ClassSet
{
public List<int> Summ(List<int> r1, List<int> r2)
{
int size1 = r1.Count;
int size2 = r2.Count;
List<int> r3 = new List<int>();
if (size1 >= size2)
{
for (int i = 0; i < size1; i++)
{
r3.Add(r1[i]);
}
for (int i = 0; i < size2; i++)
{
int k = 0;
bool isIn = false;
while (k < r3.Count)
{
if (r3[k] == r2[i])
{
isIn = true;
}
k++;
}
if (isIn == false)
{
r3.Add(r2[i]);
}
}
}
else
{
for (int i = 0; i < size2; i++)
{
r3.Add(r2[i]);
}
for (int i = 0; i < size1; i++)
{
int k = 0;
bool isIn = false;
while (k < r3.Count)
{
if (r3[k] == r1[i])
{
isIn = true;
}
k++;
}
if (isIn == false)
{
r3.Add(r1[i]);
}
}
}
r3.Sort();
return r3;
}
public List<int> Peresech (List<int>r1, List<int>r2)
{
int size1 = r1.Count;
int size2 = r2.Count;
List<int> r3 = new List<int>();
for(int i=0; i<size1; i++)
{
bool isIn = false;
for (int j=0; j<size2; j++)
{
if (r2[j]==r1[i])
{
isIn = true;
}
}
if(isIn == true)
{
r3.Add(r1[i]);
}
}
r3.Sort();
return r3;
}
public List<int> Substraction(List<int>r1, List<int>r2)
{
List<int> r3 = new List<int>();
int size1 = r1.Count;
int size2 = r2.Count;
for(int i=0; i<size1; i++)
{
bool isIn = false;
for ( int j=0; j<size2; j++)
{
if (r2[j] == r1[i])
{
isIn = true;
}
}
if (isIn == false)
{
r3.Add(r1[i]);
}
}
return r3;
}
public bool Isin(List<int>r1, int r2)
{
bool answer = false;
int size1 = r1.Count;
for (int i=0; i<size1; i++)
{
if(r1[i]==r2)
{
answer = true;
}
}
return answer;
}
}
}