C# 1,3,5,7 排列组合(3位）非递归

最新推荐文章于 2020-12-25 21:43:15 发布

gaodansoft

最新推荐文章于 2020-12-25 21:43:15 发布

阅读量327

点赞数

CC 4.0 BY-SA版权

分类专栏： .net技术文章标签： .net C#

本文链接：https://blog.youkuaiyun.com/gaodansoft/article/details/84085393

.net技术专栏收录该内容

3 篇文章

订阅专栏

本文通过C#实现深度优先搜索(DFS)与广度优先搜索(BFS)，展示了两种不同搜索策略的具体应用。DFS使用堆栈进行节点存储并深入探索，而BFS则采用队列确保按层次遍历节点。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//深度优先
class Program
{
static void Main(string[] args)
{
int[] number = new int[] { 1, 3, 5, 7 };
List data = new List();
Stack openStack = new Stack();
Tree root = new Tree();
Tree parent =root;
while (true)
{

if (parent.GetDeep() == 4)
{
parent.printf();

}
else
{
var tempSon= number.ToList();
foreach (var item in tempSon)
{
Tree Node = new Tree();
Node.NodeData = item;
Node.Parent = parent;
openStack.Push(Node);
}
}
if (openStack.Count == 0)[color=darkred][/color]
break;
var itemData= openStack.Pop();
parent = itemData;

}
System.Console.Read();

}
public static void printf(List data)
{
string d="";
data.ForEach(p => d = d + p);
System.Console.WriteLine(d);
}
}
class Tree
{
public Tree Parent;
public int NodeData;
public List Son = new List();
public int GetDeep()
{
int i=0;
var p=this;
while (true)
{
if (p == null)
{
return i;
}
else
{
p = p.Parent;
i++;

}

}

}
public void printf()
{
string pf = "";
var p = this;
while (true)
{
if (p == null)
{
System.Console.WriteLine(pf);
return;
}
else
{
if (p.NodeData != 0)
{
pf = p.NodeData + pf;
}
p = p.Parent;
}
}

}
}
//广度优先
class Program
{
static void Main(string[] args)
{
int[] number = new int[] { 1, 3};
List<int> data = new List<int>();
Stack<Tree> openStack = new Stack<Tree>();
Queue<Tree> openQueue = new Queue<Tree>();

Tree root = new Tree();
Tree parent =root;
while (true)
{

if (parent.GetDeep() == 4)
{
parent.printf();

}
else
{
var tempSon= number.ToList();
foreach (var item in tempSon)
{
Tree Node = new Tree();
Node.NodeData = item;
Node.Parent = parent;
// openStack.Push(Node);
openQueue.Enqueue(Node);
}
}
if (openQueue.Count == 0) //if (openStack.Count == 0)
break;
var itemData = openQueue.Dequeue(); //openStack.Pop();
parent = itemData;

}
System.Console.Read();

}

public static void printf(List<int> data)
{
string d="";
data.ForEach(p => d = d + p);
System.Console.WriteLine(d);
}

}
class Tree
{
public Tree Parent;
public int NodeData;
public List<Tree> Son = new List<Tree>();
public int GetDeep()
{
int i=0;
var p=this;
while (true)
{
if (p == null)
{
return i;
}
else
{
p = p.Parent;
i++;

}

}

}
public void printf()
{
string pf = "";
var p = this;
while (true)
{
if (p == null)
{
System.Console.WriteLine(pf);
return;
}
else
{
if (p.NodeData != 0)
{
pf = p.NodeData + pf;
}
p = p.Parent;
}

}

}
}