418 / 316 / 241
Регистрация: 29.05.2010
Сообщений: 796
|
|
22.12.2014, 20:53
|
3
|
Кликните здесь для просмотра всего текста
| C# | 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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
| using System;
using System.Collections;
using System.Collections.Generic;
namespace ConsoleApplication16
{
class QStack<T>:IEnumerator<T>,IEnumerable<T>,ICollection<T>
{
private T[] _arr;
private int _tail;
private int _foreachCounter;
/// <summary>
/// Stack class
/// </summary>
/// <param name="count">capacity</param>
public QStack(int count)
{
_arr=new T[count];
_tail = -1;
_foreachCounter = -1;
}
public QStack() : this(0) { }
public QStack(ICollection collection):this(0)
{
foreach (T a in collection)
{
Push(a);
}
}
public T Peek()
{
if(Count==0)
throw new Exception("Stack is empty");
return _arr[_tail];
}
public void Add(T item)
{
Push(item);
}
public void Clear()
{
_arr=new T[0];
Count = 0;
_tail = -1;
_foreachCounter = -1;
}
public bool Contains(T item)
{
bool res = false;
for (int i = 0; i <=_tail; i++)
{
if (_arr[i].Equals(item))
{
res = true;
break;
}
}
return res;
}
public void CopyTo( T[] array, int arrayIndex)
{
for (int i = arrayIndex,j=0; i < Count; i++,j++)
{
array[j] = _arr[i];
}
}
public bool Remove(T item)
{
if (!Contains(item))
return false;
T[]tmp=new T[Count];
Array.Copy(_arr,tmp,Count);
List<T>lst=new List<T>(tmp);
lst.Remove(item);
tmp = lst.ToArray();
Array.Resize(ref tmp,_arr.Length);
_arr = tmp;
Count--;
_tail--;
return true;
}
public int Count { get; private set; }
public bool IsReadOnly
{
get { return false; }
}
public void Push(T item)
{
if (_tail+1 < _arr.Length)
{
Count++;
_tail++;
_arr[_tail] = item;
}
else
{
Array.Resize(ref _arr, _arr.Length*2+10);
Count++;
_tail++;
_arr[_tail] = item;
}
}
public void Push(params T[] elements)
{
foreach (var a in elements)
{
Push(a);
}
}
public T Pop()
{
if(Count==0)
throw new Exception("Stack is empty!");
T item = _arr[_tail];
_tail--;
Count--;
return item;
}
public void Dispose()
{
_foreachCounter = -1;
}
public bool MoveNext()
{
_foreachCounter++;
return _foreachCounter < Count;
}
public void Reset()
{
throw new NotImplementedException();
}
public T Current
{
get { return _arr[_foreachCounter]; }
}
object IEnumerator.Current
{
get { return Current; }
}
public IEnumerator<T> GetEnumerator()
{
return this;
}
IEnumerator IEnumerable.GetEnumerator()
{
return GetEnumerator();
}
}
class Hill
{
private string name;
public int height;
public Hill(string name, int height)
{
this.name = name;
this.height = height;
}
public override string ToString()
{
return name + " " + height + " метров";
}
}
class Program
{
static void Main(string[] args)
{
QStack<Hill> hills = new QStack<Hill>();
hills.Push(new Hill("Гора 1 ", 1000));
hills.Push(new Hill("Гора 2 ", 2000));
double s = 0;
foreach (var a in hills)
{
s += a.height;
Console.WriteLine(a);
}
Console.WriteLine(s / hills.Count);
Console.ReadKey(true);
}
}
} |
|
1
|
(
