java:159:错误：找不到适合put（String，int）的方法
为什么它会说（字符串，int）？当我宣布它是双人的时候java:159:错误：找不到适合put（String，int）的方法,java,Java,为什么它会说（字符串，int）？当我宣布它是双人的时候 java:159: error: no suitable method found for put(String,int) myVariables.put(exprArray[i], 0); ^ method Map.put(String,Double) is not applicable (argume
java:159: error: no suitable method found for put(String,int)
myVariables.put(exprArray[i], 0);
^
method Map.put(String,Double) is not applicable
(argument mismatch; int cannot be converted to Double)
method AbstractMap.put(String,Double) is not applicable
(argument mismatch; int cannot be converted to Double)
method HashMap.put(String,Double) is not applicable
(argument mismatch; int cannot be converted to Double)
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
import java.util.Stack;
public class PostFixCalc {
public static boolean isCommandPromptOn = true;
public static HashMap<String,Double> myVariables = new HashMap<String, Double>();
public static String[] input;
public static boolean variableCalcuation = false;
public static void main(String[] args)
{
Scanner myScanner = new Scanner(System.in);
System.out.println("Integer postfix calculator with memory by XXXXXX");
do
{
System.out.print("\n> ");
input = myScanner.nextLine().split("\\s");
commandOperator(input);
}while(isCommandPromptOn);
}
public static void commandOperator(String[] command)
{
variableCalcuation = false;
if(command.length > 1)
{
if(command[1].equals("="))
{
variableCalcuation = true;
double temp = postFixExpr(Arrays.copyOfRange(command,2,command.length));
if(temp != -123) {
myVariables.put(command[0], temp);
}
return;
}
}
for (int i = 0; i < command.length; i++)
{
switch (command[i])
{
case "quit":
isCommandPromptOn = false;
break;
case "clear":
myVariables.clear();
break;
case "delete":
myVariables.remove(command[i + 1]);
break;
case "var":
System.out.println(myVariables);
break;
case "":
System.out.println("Invalid input!");
break;
case "about":
System.out.println("Postfix calculator by Samuel Fipps");
System.out.println("Operators and functions: + - * / ^ sin cos tan sqrt");
System.out.println("Commands: var clear quit about");
break;
default:
postFixExpr(command);
return;
}
}
}
public static double postFixExpr(String[] exprArray)
{
double result = -123;
Stack<Double> exprStack = new Stack <Double>();
for (int i =0; i < exprArray.length;i++)
{
try {
switch (exprArray[i]) {
case "+":
double sum = exprStack.pop() + exprStack.pop();
exprStack.push(sum);
break;
case "-":
double b = exprStack.pop();
double a = exprStack.pop();
exprStack.push(a - b);
break;
case "*":
exprStack.push(exprStack.pop() * exprStack.pop());
break;
case "/":
double b1 = exprStack.pop();
double a1 = exprStack.pop();
if (b1 == 0) {
System.out.println("Division by zero. Undefined.");
result = -123;
break;
}
exprStack.push((double) (a1 / b1));
break;
case "^":
double b2 = exprStack.pop();
double a2 = exprStack.pop();
exprStack.push((double) (Math.pow(a2, b2)));
break;
// case "!":
// double a3 = exprStack.pop();
//exprStack.push(factorialCalculator(a3));
//break;
case "":
System.out.println("Invalid Input. Please try again!");
break;
default:
if (myVariables.containsKey(exprArray[i])) {
exprStack.push(myVariables.get(exprArray[i]));
} else {
try {
exprStack.push(Double.parseDouble(exprArray[i]));
} catch (Exception e) {
myVariables.put(exprArray[i], 0);
try {
exprStack.push(myVariables.get(exprArray[i]));
} catch (Exception e1) {
System.out.println("Error: " + e);
}
}
}
break;
}
}
catch (Exception e){
if(!variableCalcuation){
System.out.println("Error! Too many operators.");
}else
{
System.out.println("Error! Too many operators. ");
return -123;
}
}
}
if(exprStack.size() == 0){
if(variableCalcuation){
return -123;
}
return result;
}
else if(exprStack.size() == 1 ){
result = exprStack.pop();
System.out.println(result);
return result;
}
else
{
if(variableCalcuation){
System.out.println("Error! Not enough operators.");
return -123;
}
System.out.println("Error! Not enough operators.");
return result;
}
}
public static double factorialCalculator(double num){
if(num == 0){
return 1;
}
else{
return num * factorialCalculator(num -1);
}
}
}
导入java.util.array；
导入java.util.HashMap；
导入java.util.Scanner；
导入java.util.Stack；
公共类PostFixCalc{
公共静态布尔值isCommandPromptOn=true；
public static HashMap myVariables=new HashMap（）；
公共静态字符串[]输入；
公共静态布尔变量计算=false；
公共静态void main（字符串[]args）
{
Scanner myScanner=新扫描仪（System.in）；
System.out.println（“内存为XXXXXX的整数后缀计算器”）；
做
{
系统输出打印（“\n>”）；
input=myScanner.nextLine（）.split（\\s”）；
命令运算符（输入）；
}while（是常见的Prompton）；
}
公共静态void命令运算符（字符串[]命令）
{
变量计算=假；
如果（command.length>1）
{
if（命令[1]。等于（“=”）
{
变量计算=真；
double-temp=postfix-expr（Arrays.copyOfRange（command，2，command.length））；
如果（温度！=-123）{
myVariables.put（命令[0]，temp）；
}
返回；
}
}
for（int i=0；iintDoubleDoubleDoublemyVariables.put(exprArray[i], 0);
myVariables.put(exprArray[i], 0.0);