Spirit

導(dǎo)航

統(tǒng)計

隨筆 - 2
文章 - 0
評論 - 1
引用 - 0

常用鏈接

留言簿(1)

隨筆檔案

2005年12月 (2)

Google Code Jam - SkipStones的一種遞歸算法

public class SkipStones {
private String water = "

X

";

    public int maxDistance(String water) {
        this.water = water;
        int max = 0;
        int sum = 0;
        for (int initial = 1; initial < water.length() + 1; initial++) {
            sum = bounce(0, initial);
            max = (sum > max ? sum : max);
        }
        return max;
    }

    private int bounce(int startDistance, int bounceDistance) {
        if (bounceDistance == 0)
            return startDistance;

        if ((startDistance + bounceDistance) > water.length())
            return -1;

        if (water.charAt(startDistance + bounceDistance - 1) == 'X')
            return startDistance;

        return bounce(startDistance + bounceDistance, bounceDistance / 2);
    }

    public static void main(String[] args) {
        SkipStones skipStones = new SkipStones();
        System.out.println(skipStones.maxDistance(args[0]));
    }
}

posted on 2005-12-15 13:29 Spirit 閱讀(361) 評論(1) 編輯收藏

# re: Google Code Jam - SkipStones的一種遞歸算法 2009-05-10 05:41 exceptionxu