-
February 20th, 2013, 09:52 AM
#1
please help me now now now
write a code in c# that
Given a text, we need to look up the longest valid infix expression in the text and return its evaluation.
The following expressions are a valid infix expressions:
* a
* a+b
* (a/b)
* (a + b) + (c) * a /c
Input example:
* “abcd 6 (4+3)*9yuy 6*((4+2)-(8-2))”
Output:
* 6 * ( ( 4 + 2 ) – ( 8 – 2 ) )
* result : 0.
....................................................
use stack and queu
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|