codewars052: 倖存者: 約瑟夫環問題

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
• 約瑟夫環問題