[코딩인터뷰] 문제 2.1

문제 2.1

	#region Question 2.1
	/// <summary>
	/// 정렬되지 않은 연결 리스트에서 중복 문자를 제거하라.
	/// (임시 버퍼가 허용되지 않는 상황)
	/// </summary>
	/// <typeparam name="T"><code>IComparable</code></typeparam>
	/// <param name="head">리스트의 시작지점</param>
	public static void Q1_RemoveDuplicates<T>(LinkedListNode<T> head) where T : IComparable<T>
	{
	if (head == null) return;
	LinkedListNode<T> current = head;
	while (current != null)
	{
	LinkedListNode<T> runner = current;
	while (runner.Next != null)
	{
	if (current.Data.CompareTo(runner.Next.Data) == 0)
	{
	runner.Next = runner.Next.Next;
	if (runner.Next != null)
	{
	runner.Next.Prev = runner;
	}
	}
	else
	{
	runner = runner.Next;
	}
	}
	current = current.Next;
	}
	}
	#endregion

view raw Code_Q2_1.cs hosted with ❤ by GitHub

	[TestMethod]
	public void Q2_1()
	{
	Random rand = new Random();
	LinkedListNode<char> head = new LinkedListNode<char>(Convert.ToChar(rand.Next(65, 91)), null, null);
	LinkedListNode<char> prev = head;
	for (int index = 0; index < 10; index++)
	{
	var next = new LinkedListNode<char>(Convert.ToChar(rand.Next(65, 91)), null, prev);
	prev.SetNext(next);
	prev = next;
	}
	LinkedList.Q1_RemoveDuplicates<char>(head);
	var a = head;
	while (a.Next != null)
	{
	var b = a;
	while (b.Next != null)
	{
	b = b.Next;
	Assert.AreNotEqual(a.Data, b.Data);
	}
	a = a.Next;
	}
	}

view raw Test_Q2_1.cs hosted with ❤ by GitHub