knenet https://blog.hatena.ne.jp/knenet/ 象徴ヶ淵 https://knenet.hatenadiary.jp/ lisp 順列を列挙する関数が野暮用で必要になったが、すぐに書けなかったので書き方を調べた。要素を木構造にして深さ優先探索(DFS)で書けば良いらしい。簡単だね！ (defun permutation (args &optional num head res) (labels ((iter (args num head res) (if (and (plusp num) args) (let (l) (dotimes (i (length args) (apply 'nconc (nreverse l))) (push (iter (nconc (subseq args 0 i) (subseq arg… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fknenet.hatenadiary.jp%2Fentry%2F20121217%2F1355754551" title="順列の列挙 - 象徴ヶ淵" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2012-12-17 23:29:11 rich https://knenet.hatenadiary.jp/entry/20121217/1355754551 1.0 100%