Last active
December 14, 2015 21:59
-
-
Save epson121/5155574 to your computer and use it in GitHub Desktop.
Variable-Base Expression Evaluation
http://www.palantir.com/challenge/
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
You've woken up one day to find that everyone suddenly expresses numbers in different number bases. You're seeing prices in octal and phone numbers in hexadecimal. It's a numerical Tower of Babel! For your own sanity, you decide to program a simple mathematical expression evaluator that can handle numbers in different number bases. It should support addition, subtraction, and multiplication, should respect order of operations, and should handle number bases between 2 and 16. | |
While your language of choice may directly support expression evaluation, please create your own. | |
The input on stdin is a mathematical expression on a single line. Number constants are expressed like "123_4", which is "123" in base 4, which is 27 in base 10. Some digits in the higher bases will be represented with uppercase letters. Numbers within the expression will always be non-negative integers. The operators will be +, -, and *. Whitespace should be ignored. | |
Your program should emit to stdout a single base-10 number with no underscores. | |
While correctness and performance are the most important parts of this problem, a human will be reading your solution, so please make an effort to submit clean, readable code. In particular, do not write code as if you were solving a problem for a competition. | |
Here's an example input and output: | |
Input: | |
1430_5 - 110_2 * 2A_12 + 10_10 | |
Output: | |
46 | |
*/ | |
import java.util.*; | |
import javax.script.ScriptEngineManager; | |
import javax.script.ScriptEngine; | |
public class Palantir{ | |
public Palantir() {} | |
public void parseExpression(List<String> expr){ | |
String infixDecimalExpression = ""; | |
for (String str : expr){ | |
if (!str.equals("+") && !str.equals("*") && !str.equals("-")){ | |
String temp = convertToBase10(str); | |
infixDecimalExpression += temp; | |
} | |
else{ | |
infixDecimalExpression += str; | |
} | |
} | |
ScriptEngineManager mgr = new ScriptEngineManager(); | |
ScriptEngine engine = mgr.getEngineByName("JavaScript"); | |
try{ | |
System.out.println(engine.eval(infixDecimalExpression)); | |
} | |
catch (Exception e){ | |
System.out.println("Exception!"); | |
} | |
} | |
private String convertToBase10(String num){ | |
int result = 0; | |
String[] pNumber = num.split("_"); | |
String number = pNumber[0]; | |
int base = Integer.parseInt(pNumber[1]); | |
for (int i = 0; i < number.length(); i++){ | |
result += Character.getNumericValue(number.charAt(number.length() - i - 1)) * Math.pow(base, i); | |
} | |
return "" + result; | |
} | |
public static void main(String[] args){ | |
List<String> tokens = new ArrayList<String>(); | |
Palantir p; | |
Scanner sc = new Scanner(System.in); | |
while(sc.hasNext()){ | |
String expr = sc.next(); | |
tokens.add(expr); | |
} | |
p = new Palantir(); | |
p.parseExpression(tokens); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment