프로그래머스 C# 공 던지기(주기성 찾기, P, J)

using System;

public class Solution {
    public int solution(int[] numbers, int k) {
        int answer = 0;
        int i =0;
        int j = 0;
        
        for(i=0;i<k-1;i++)
        {
            if(j<numbers.Length-2)
            {
                answer = numbers[j+2];
                j = j + 2;
            }
            else if(j == numbers.Length-2)
            {
                answer = numbers[0];
                j = 0;
            }
            else if(j ==numbers.Length-1)
            {
                answer = numbers[1];
                j = 1;
            }
        }
        
        return answer;
    }
}

 

//////

 

using System;

public class Solution {
    public int solution(int[] numbers, int k) {
        int answer = numbers[(k * 2 - 2) % numbers.Length];
        return answer;
    }
}

// 규칙성을 찾아내는 것도 중요한 열쇠

// k * 2 - 2 = 2*(k-1)

 

파이썬

/////

 

def solution(numbers, k):
    return numbers[2 * (k - 1) % len(numbers)]

 

자바

/////

 

class Solution {
    public int solution(int[] numbers, int k) {
        return (k-1)*2 % numbers.length+1;
    }
}

 

 

class Solution {
    public int solution(int[] numbers, int k) {
        int answer = 0;
        answer = numbers[((1 + ((k-1)*2))%numbers.length) - 1];
        return answer;
    }
}