CSharp.AlgorithmsAndDataStructures/DataStructures/Algorithms/StackProblem/BalancedParenthesis.cs at master · leodeg/CSharp.AlgorithmsAndDataStructures · GitHub

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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace DA.Algorithms.StackProblem
{
	public static class BalancedParenthesis
	{
		public static bool IsBalancedParenthesis (string expression)
		{
			Stack<char> stackExpression = new Stack<char> ();

			foreach (char item in expression)
			{
				switch (item)
				{
					case '{':
					case '[':
					case '(':
						stackExpression.Push (item);
						break;

					case '}':
						if (stackExpression.Pop () != '{') return false;
						break;

					case ']':
						if (stackExpression.Pop () != '[') return false;
						break;

					case ')':
						if (stackExpression.Pop () != '(') return false;
						break;

					default: break;
				}
			}
			return stackExpression.Count == 0;
		}
	}
}