Don_Yao整合修复一些bug后的代码
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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
|
using System; using System.Collections; using System.Collections.Generic; using System.Text; // 解析计算字符串公式 namespace CalcuStrFormula { // 处理类 class Handler { private Stack _complexNumberStack = new Stack(); private Stack _operatorStack = new Stack(); private Parser _parser = new Parser(); private Operators _operators = new Operators(); private static Handler _instance; public static Handler instance { get { if (_instance == null ) { _instance = new Handler(); } return _instance; } } public ComplexNumber Process( string inputString) { _complexNumberStack.Clear(); _operatorStack.Clear(); Queue< object > queue = _parser.Parse(inputString); ComplexNumber complexNumber = null ; char op, topOp; int count = queue.Count; for ( int i = 0; i < count; i++) { object obj = queue.Dequeue(); if (obj is char ) { op = ( char )obj; if (_operatorStack.Count == 0) { _operatorStack.Push(op); } else { topOp = ( char )_operatorStack.Peek(); if (op == '(' ) { _operatorStack.Push(op); // 左括号直接压入。不判断栈顶 } else if (op == ')' ) { // 右括号压入前观察栈顶,若栈顶是左括号,则弹出栈顶的左括号 // 否则弹出栈顶运算符,从数栈中弹出操作数进行运算,并将结果重新压入数栈,直到遇到左括号 while ((topOp = ( char )_operatorStack.Pop()) != '(' ) { ComplexNumber c1 = (ComplexNumber)_complexNumberStack.Pop(); // 符号右边数 ComplexNumber c2 = null ; // 符号左边数 if (_operators.IsTwoNumOperator(topOp)) { c2 = (ComplexNumber)_complexNumberStack.Pop(); } ComplexNumber c3 = _operators.Compute(topOp, c2, c1); _complexNumberStack.Push(c3); } } else if (_operators.ComparePriority(topOp, op) <= 0) { // 若即将压入的运算符不是括号,则比较栈顶运算符和即将压入的运算符的优先级 // 如果栈顶优先级高,则将栈顶运算符取出运算,直到栈顶优先级不大于其。 while (_operatorStack.Count != 0 && _operators.ComparePriority(( char )_operatorStack.Peek(), op) <= 0) { topOp = ( char )_operatorStack.Pop(); ComplexNumber c1 = (ComplexNumber)_complexNumberStack.Pop(); // 符号右边数 ComplexNumber c2 = null ; // 符号左边数 if (_operators.IsTwoNumOperator(topOp)) { c2 = (ComplexNumber)_complexNumberStack.Pop(); } ComplexNumber c3 = _operators.Compute(topOp, c2, c1); _complexNumberStack.Push(c3); } _operatorStack.Push(op); } else { _operatorStack.Push(op); } } } else if (obj is ComplexNumber) { complexNumber = (ComplexNumber)obj; _complexNumberStack.Push(complexNumber); } if (queue.Count == 0) { while (_operatorStack.Count != 0) { topOp = ( char )_operatorStack.Pop(); ComplexNumber c1 = (ComplexNumber)_complexNumberStack.Pop(); // 符号右边数 ComplexNumber c2 = null ; // 符号左边数 if (_operators.IsTwoNumOperator(topOp)) { c2 = (ComplexNumber)_complexNumberStack.Pop(); } ComplexNumber c3 = _operators.Compute(topOp, c2, c1); _complexNumberStack.Push(c3); } } } return (ComplexNumber)_complexNumberStack.Pop(); } } // 3+4i解析成Queue包含 3, +, 4i public class Parser { private Operators _operators = new Operators(); public Queue< object > Parse( string input) { input = input.Replace( " " , "" ); if (input.StartsWith( "-" )) input = '0' + input; char [] arr = input.ToCharArray(); Queue< char > queueChar = new Queue< char >(); foreach ( char x in arr) { queueChar.Enqueue(x); } Queue< object > queueResult = ParseStringQueue(queueChar); return queueResult; } // 传入字符串队列,返回封装好的队列。 // ComplexNumber对象或char类型运算符各占用一个结点 private Queue< object > ParseStringQueue(Queue< char > queue) { Queue< object > secondQ = new Queue< object >(); char c; StringBuilder sb = null ; string temp; int count = queue.Count; bool flag = false ; // false表示允许创建新SB对象进行缓存数字字符串 for ( int i = 0; i < count; i++) { c = queue.Dequeue(); if (!_operators.Contains(c)) { // 如果扫描到的不是运算符,则将其加入到buffer尾部 if (!flag) { flag = true ; sb = new StringBuilder(); } sb.Append(c); } if (_operators.Contains(c) || queue.Count == 0) { // 如果扫描到的是运算符,则将缓冲区中的串加入队尾 if (sb != null && flag == true ) { temp = sb.ToString(); try { if (temp.EndsWith( "i" )) { if (temp.Length == 1) { secondQ.Enqueue( new ComplexNumber(0, 1)); } else { // i前有数字则开出数字部分。 temp = temp.Substring(0, temp.Length - 1); secondQ.Enqueue( new ComplexNumber(0, double .Parse(temp))); } } else { secondQ.Enqueue( new ComplexNumber( double .Parse(temp), 0)); } sb = null ; flag = false ; } catch (Exception e) { UnityEngine.Debug.Log( "Error " + e.ToString()); } } // 如果是运算符,则最后将运算符放入队。 if (_operators.Contains(c)) { secondQ.Enqueue(c); } } } return secondQ; } } // 复数类,提供实数域虚数域,getset方法,加减乘除以及toString()方法 class ComplexNumber { private double _realPart; // 实数部分 private double _imaginPart; // 虚数部分 public ComplexNumber() { _realPart = 0.0; _imaginPart = 0.0; } public ComplexNumber( double r, double i) { _realPart = r; _imaginPart = i; } public ComplexNumber(ComplexNumber c) { _realPart = c.GetRealPart(); _imaginPart = c.GetImaginaryPart(); } // get,set方法 public double GetRealPart() { return _realPart; } public double GetImaginaryPart() { return _imaginPart; } public void SetRealPart( double d) { _realPart = d; } public void SetImaginaryPart( double d) { _imaginPart = d; } // 加 public ComplexNumber ComplexAdd(ComplexNumber c) { return new ComplexNumber(_realPart + c.GetRealPart(), _imaginPart + c.GetImaginaryPart()); } public ComplexNumber ComplexAdd( double c) { return new ComplexNumber(_realPart + c, _imaginPart); } // 减 public ComplexNumber ComplexMinus(ComplexNumber c) { return new ComplexNumber(_realPart - c.GetRealPart(), _imaginPart - c.GetImaginaryPart()); } public ComplexNumber ComplexMinus( double c) { return new ComplexNumber(_realPart - c, _imaginPart); } // 乘 public ComplexNumber ComplexMulti(ComplexNumber c) { return new ComplexNumber( _realPart * c.GetRealPart() - _imaginPart * c.GetImaginaryPart(), _realPart * c.GetImaginaryPart() + _imaginPart * c.GetRealPart()); } public ComplexNumber ComplexMulti( double c) { return new ComplexNumber(_realPart * c, _imaginPart * c); } // 除 public ComplexNumber ComplexDivision(ComplexNumber c) { return new ComplexNumber((_realPart * c.GetRealPart() + _imaginPart * c.GetImaginaryPart()) / (c.GetRealPart() * c.GetRealPart() + c.GetImaginaryPart() * c.GetImaginaryPart()) , (_imaginPart * c.GetRealPart() - _realPart * c.GetImaginaryPart()) / (c.GetRealPart() * c.GetRealPart() + c.GetImaginaryPart() * c.GetImaginaryPart())); } public ComplexNumber ComplexDivision( double c) { return new ComplexNumber(_realPart / c, _imaginPart / c); } // 幂 public ComplexNumber ComplexPow(ComplexNumber c) { int pow; if ( int .TryParse(c.GetRealPart().ToString(), out pow)) { ComplexNumber origin = new ComplexNumber( this ); ComplexNumber multi = new ComplexNumber( this ); for ( int i = 0; i < pow - 1; i++) { origin = origin.ComplexMulti(multi); } return origin; } else { return ComplexPow(c.GetRealPart()); } } public ComplexNumber ComplexPow( double c) { return new ComplexNumber(Math.Pow(_realPart, c), 0.0); } // 最小值 public ComplexNumber ComplexMinimum(ComplexNumber c) { if (_realPart <= c.GetRealPart()) return this ; return c; } // 最大值 public ComplexNumber ComplexMaximum(ComplexNumber c) { if (_realPart >= c.GetRealPart()) return this ; return c; } // 转int public ComplexNumber ToFloorInt() { _realPart = Math.Floor(_realPart); return this ; } public override string ToString() { return "(" + _realPart + " + " + _imaginPart + " i" + ")" ; } } // 操作符类 class Operators { private char [][] _signOperator; public Operators() { // 从上到下,优先级由高到低 _signOperator = new char [4][]; _signOperator[0] = new char [4]; _signOperator[0][0] = '^' ; _signOperator[0][1] = 's' ; // 最小值 _signOperator[0][2] = 'b' ; // 最大值 _signOperator[0][3] = 'i' ; // int值 _signOperator[1] = new char [2]; _signOperator[1][0] = '*' ; _signOperator[1][1] = '/' ; _signOperator[2] = new char [2]; _signOperator[2][0] = '+' ; _signOperator[2][1] = '-' ; _signOperator[3] = new char [2]; _signOperator[3][0] = '(' ; _signOperator[3][1] = ')' ; } // 比较操作符优先级 public int ComparePriority( char firstSign, char secondSign) { int priorityF = 0, priorityS = 0; for ( int i = 0; i < _signOperator.Length; i++) { foreach ( char x in _signOperator[i]) { if (firstSign == x) { priorityF = i; } if (secondSign == x) { priorityS = i; } } } return (priorityF - priorityS); } // 是否是需要两个参数的操作符 public bool IsTwoNumOperator( char op) { if (op == 'i' ) return false ; return true ; } public bool Contains( char x) { if (x == '(' || x == ')' ) { UnityEngine.Debug.LogError(x + "为中文字符,请改为英文字符" ); } foreach ( char [] arr in _signOperator) { foreach ( char y in arr) { if (x == y) { return true ; } } } return false ; } public ComplexNumber Compute( char op, ComplexNumber c1, ComplexNumber c2) { ComplexNumber result = null ; switch (op) { case '+' : result = c1.ComplexAdd(c2); break ; case '-' : result = c1.ComplexMinus(c2); break ; case '*' : result = c1.ComplexMulti(c2); break ; case '/' : result = c1.ComplexDivision(c2); break ; case '^' : result = c1.ComplexPow(c2); break ; case 's' : result = c1.ComplexMinimum(c2); break ; case 'b' : result = c1.ComplexMaximum(c2); break ; case 'i' : result = c2.ToFloorInt(); break ; } return result; } } } |
栏目列表
最新更新
nodejs爬虫
Python正则表达式完全指南
爬取豆瓣Top250图书数据
shp 地图文件批量添加字段
爬虫小试牛刀(爬取学校通知公告)
【python基础】函数-初识函数
【python基础】函数-返回值
HTTP请求:requests模块基础使用必知必会
Python初学者友好丨详解参数传递类型
如何有效管理爬虫流量?
SQL SERVER中递归
2个场景实例讲解GaussDB(DWS)基表统计信息估
常用的 SQL Server 关键字及其含义
动手分析SQL Server中的事务中使用的锁
openGauss内核分析:SQL by pass & 经典执行
一招教你如何高效批量导入与更新数据
天天写SQL,这些神奇的特性你知道吗?
openGauss内核分析:执行计划生成
[IM002]Navicat ODBC驱动器管理器 未发现数据
初入Sql Server 之 存储过程的简单使用
这是目前我见过最好的跨域解决方案!
减少回流与重绘
减少回流与重绘
如何使用KrpanoToolJS在浏览器切图
performance.now() 与 Date.now() 对比
一款纯 JS 实现的轻量化图片编辑器
关于开发 VS Code 插件遇到的 workbench.scm.
前端设计模式——观察者模式
前端设计模式——中介者模式
创建型-原型模式