前幾日看到一個關於約瑟夫環的面試題，於是試著動手做了一下，沒有採用.Net類庫的LinkedList類，自己實現了一個迴圈鏈表結構，然後類比遊戲過程得出結果。
具體代碼如下：
代碼class Program
{
static void Main(string[] args)
{
const int HUMAN_MAX = 17;
const int HUMAN_INDEX = 3;
const int HUMAN_NUMBER = 0;
LinkTable<Human> list = new LinkTable<Human>();
for (int i = 0; i < HUMAN_MAX; i++)
{
list.Add(new Human(i));
}
Human human = list.First;
int number = HUMAN_NUMBER;
do
{
if (number == HUMAN_INDEX)
{
number = 0;
Console.WriteLine(human.ID);
list.Remove(human);
}
else
{
number++;
human = (Human)human.Next;
}
}
while (human.Next != human);
Console.WriteLine(human.ID);
Console.Read();
}
public class Human : LinkTableNode {
public Human(int id){
this.ID = id;
}
public int ID{get;set;}
}
/// <summary>
/// 圓環鏈表
/// </summary>
/// <typeparam name="T"></typeparam>
public class LinkTable<T> where T : LinkTableNode
{
public List<T> list = new List<T>();
public T First
{
get
{
return list.Count > 0 ? list[0] : default(T);
}
}
public void Add(T t)
{
t.Previous = list.Count == 0 ? t : list[list.Count - 1];
t.Next = list.Count == 0 ? t : list[0];
if (list.Count > 0)
{
list[0].Previous = t;
t.Previous.Next = t;
}
list.Add(t);
}
public void Remove(T t)
{
int i = list.IndexOf(t);
if(list.Count == 1)
{
list.Remove(t);
}
else
{
t.Previous.Next = t.Next;
t.Next.Previous = t.Previous;
}
}
}
/// <summary>
/// 鏈表節點
/// </summary>
public class LinkTableNode
{
/// <summary>
/// 下一個節點
/// </summary>
public LinkTableNode Next
{
get;
set;
}
/// <summary>
/// 上一個節點
/// </summary>
public LinkTableNode Previous
{
get;
set;
}
}
}
