codewars052: 幸存者: 约瑟夫环问题

2019独角兽企业重金招聘Python工程师标准>>>

Instructions:

Josephus Survior

Solutions:

//--https://www.codewars.com/kata/555624b601231dc7a400017a/train/java
public class JosephusSurvivor{
    public static int josephusSurvivor(final int n, final int k){
        int result = 0; // when n = 1, the survivor's index
        for(int I = 2; I <= n; i++){
            result = (result + k) % i;
        }    
        return result + 1; // the number is its index plus 1        
    }    
}

Example Tests:

To be done
https://www.codewars.com/kata/555624b601231dc7a400017a/train/java

References

• 幸存者：约瑟夫环问题
• 约瑟夫问题@BaiduBaike
• 约瑟夫环问题

转载于:https://my.oschina.net/u/553266/blog/823793