我在这个查找数量的唯一路径算法中做错了什么？

Question

问题陈述：https://pastebin.com/LzvZecyQ

我有2个输入文件来测试这个算法。

第一：https://pastebin.com/BtsiZqqn

我得到了这个输出：

案例＃1：5

（这个很好）

第二名：https://pastebin.com/fTbdbpnW

我得到了这个输出：

案例＃1：1

案例＃2：1

案例＃3：9

案例＃4：4

案例＃5：101

案例＃6：3.125

问题：所有情况都可以，但第6个错误。

我正在使用此代码：

public class DemoApplication {

    private static final  Logger LOGGER = Logger.getLogger("com.example.demo.DemoApplication");
    private static final String TEMPLATE = "Case #{0}: {1}\r\n";
    private static final String PLANET_START = "Galactica";
    private static final String PLANET_END = "New Earth";

    public static void main(String args[]) {
        String inputFilePath = "testInput.txt";
        String outputFilePath = "output.txt";

        try (BufferedReader reader = Files.newBufferedReader(Paths.get(inputFilePath))) { //Create the reader with the file path of testInput.txt
            try (BufferedWriter writer = Files.newBufferedWriter(Paths.get(outputFilePath))) { //Create the writer with the file path we want the output
                String line = reader.readLine();//skip first row
                int i = 0;//Counter of lines
                Map<String, String[]> planets = null;

                int caseNumber = 0;

                while ((line = reader.readLine()) != null) {//Get the value of the current line
                    if (!isNumeric(line)) {
                        String[] split = line.split(":");//Split planet name and the paths
                        String planetName = split[0];
                        String[] connections = split[1].split(",");//Split different planets
                        planets.put(planetName, connections);
                        i++;
                    } else {
                        if (i > 0) {
                            writeFile(writer, planets, ++caseNumber);
                        }
                        planets = new HashMap<>();//reset
                        i = 0;//reset
                    }
                }
                writeFile(writer, planets, ++caseNumber);
            }
        } catch (IOException e) {
            LOGGER.log(Level.WARNING, MessageFormat.format("IOException: {0}", e));
        }
    }

    private static boolean isNumeric(String input) {
        Pattern p = Pattern.compile("\\d+\\.?\\d*");
        return p.matcher(input).matches();
    }

    private static int differentPaths(Map<String, String[]> planets, String planetName) {
        if (planetName.equals(PLANET_END)) {//Last planed to arrive
            return 1;
        } else {
            int accumulator = 0;
            String[] paths = planets.get(planetName);

            for (int i = 0; i < paths.length; i++) {
                accumulator += differentPaths(planets, paths[i]);
            }
            return accumulator;
        }
    }

    private static void writeFile(BufferedWriter writer, Map<String, String[]> planets, int caseNumber) throws IOException {
        int result = differentPaths(planets, PLANET_START);//First planet from we start
        writer.write(MessageFormat.format(TEMPLATE, caseNumber, result));//Write in file
    }
}

我做错了什么？如果可能的话，我更喜欢解释为什么这不适用于案例6而不是给我解决方案。这是因为我正在尝试学习算法。

这个问题是tuenti挑战的第二个问题（https://contest.tuenti.net/Contest）如果有人感兴趣我认为你仍然可以参加。

提前致谢。

解：

更改方法以将输出转换结果写入String，这样做，MessageFormat.format不会将点添加为小数分隔符

private static void writeFile(BufferedWriter writer, Map<String, String[]> planets, int caseNumber) throws IOException {
        int result = differentPaths(planets, PLANET_START);//First planet from we start
        writer.write(MessageFormat.format(TEMPLATE, caseNumber, Integer.toString(result)));//Write in file
    }

Answer 1

您的算法似乎运行良好，也许问题出在MessageFormat.format方法中，3.125可能是3125，而dot只是千位分隔符。