De Bruijn's sequence: 2^(2^(n-1) - n): number of ways of arranging 2^n bits in circle so all 2^n consecutive strings of length n are distinct. (摘自OEIS)
这里给出一个搜索De Bruijn序列的程序 程序效率可能并不高（因为写的是递归搜索，很容易就堆栈溢出）
这只是一个玩具 有需要的可以自取
反正我的程序协议都是GPL V3~
-
Notifications
You must be signed in to change notification settings - Fork 0
License
Neutron3529/deBruijn
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published