组合锁码(Combination lock code)

 我正试图解决旧的组合锁程序。 问题在下面。 我写了一些代码，但到目前为止，它只打印出一串总是包含第一个数字的可能组合。我真的非常困惑，要把它放在哪里才能到达需要的地方。 
 
 “想象一下，你需要打开一个标准的组合拨号锁，但不知道这个组合，并且没有一对螺栓刀。在BlueJ中用一种打印所有可能的组合的方法写一个Java程序，以便你可以在在你尝试的时候检查每一个，假设每个拨号盘上的数字范围从0到36，并且需要依次打开三个数字来打开锁，假设锁不是很好，与每个数字中的正确数字相距不超过两位的数字也将起作用，换句话说，如果组合是17-6-32，则18-5-31,19-4-32,15-8-33和许多其他组合也会打开锁，编写另一种方法，打印出你需要保证打开锁的最小组合列表。“ 
 
     /**
     * A method that prints all possible combinations of the lock.
     */
    public void combination(int combo)
    {
        int a;
        int b;
        int c;
        a = 0;
        while (a <= 36)
                {b = 0;
                while (b <= 36)
                    {c = 0;
                    while (c <= 36)
                    {
                        System.out.println(a + " " + b + " " + c);
                        c = c + 1;
                    }
                    b = b + 1;
                }
                a = a + 1;
                }
    }
}

I'm trying to solve the old combination lock program. The question is below. I've wrote some code, but so far it only prints a bunch of possible combinations that always contain the first number having 36. I'm honestly super confused as to where to get it to where it needs to be.
 
"Imagine you need to open a standard combination dial lock but don't know the combination and don't have a pair of bolt cutters. Write a Java program in BlueJ with a method that prints all possible combinations so you can print them on a piece of paper and check off each one as you try it. Assume the numbers on each dial range from zero to thirty-six and three numbers in sequence are needed to open the lock. Suppose the lock isn't a very good one and any number that's no more than two away from the correct number in each digit will also work. In other words if the combination is 17-6-32, then 18-5-31, 19-4-32, 15-8-33 and many other combinations will also open the lock. Write another method that prints out a minimal list of combinations you would need to try to guarantee opening the lock. " 
 
     /**
     * A method that prints all possible combinations of the lock.
     */
    public void combination(int combo)
    {
        int a;
        int b;
        int c;
        a = 0;
        while (a <= 36)
                {b = 0;
                while (b <= 36)
                    {c = 0;
                    while (c <= 36)
                    {
                        System.out.println(a + " " + b + " " + c);
                        c = c + 1;
                    }
                    b = b + 1;
                }
                a = a + 1;
                }
    }
}

原文：https://stackoverflow.com/questions/49955152