※[프로그래머스]Lv.2 귤 고르기C# (Dictionary.TryAdd 중복 카운터)

https://school.programmers.co.kr/learn/courses/30/lessons/138476

프로그래머스

소스코드1

using System;
using System.Collections.Generic;
using System.Linq;
public class Solution
{
    public int solution(int k, int[] tangerine)
    {
        int answer = 0;

        var distinct = tangerine.GroupBy(g => g).Select(s => s.Count());

        var orderBy = distinct.OrderByDescending(x => x).ToList();

        int resualt = k;
        while (resualt > 0)
        {
            resualt -= orderBy[answer];
            answer++;
        }

        return answer;
    }
}

소스코드 2 (Dictionary TryAdd)

using System;
using System.Collections.Generic;
using System.Linq;
public class Solution
{
    public int solution(int k, int[] tangerine)
    {
        int answer = 0;

        Dictionary<int, int> dic = new Dictionary<int, int>();

        for (int i = 0; i < tangerine.Length; i++)
        {
            if (dic.TryAdd(tangerine[i], 1) == false)
            {
                dic[tangerine[i]] += 1;
            }
        }

        List<int> list = dic.Values.ToList().OrderByDescending(o => o).ToList();

        int resualt = k;
        while (resualt > 0)
        {
            resualt -= list[answer];
            answer++;
        }

        return answer;
    }
}