[프로그래머스 C#] 최대공약수와 최소공배수

https://programmers.co.kr/learn/courses/30/lessons/12940

코딩테스트 연습 - 최대공약수와 최소공배수

public class Solution {
        int GreatestCommonDivisor(int num_1, int num_2)
        {
            int swap;
            while (num_2 != 0)
            {
                   swap = num_1 % num_2;
                   num_1 = num_2;                
                   num_2 = swap;
            }
            return num_1;
        }
    
        int LeastCommonMultiple(int num_1, int num_2)
        {
            int i;
            for(i = 0; !(++i % num_1 == 0 && i % num_2 == 0););
            return i;
        }  

    public int[] solution(int n, int m) {
        int[] answer = new int[] {GreatestCommonDivisor(m, n), LeastCommonMultiple(n, m)};
        return answer;
    }
}

for문을 간략히