无聊中，弄个组合排列

feng582304

2. (defun aa ( nmax nst / li )
   
3.   (repeat (- nmax nst)
   
4.     (setq li (cons (setq nst (1+ nst)) li))
   
5.     )
   
6.   (REVERSE li)
   
7.   )
   
8. (defun bb ( nst nmax n / ll )
   
9.   (while (< nst nmax)
   
10.     (if (= n 2)
    
11.       (setq ll (cons (MAPCAR '(LAMBDA (x) (cons nst (if (listp x) x (list x)))) (aa nmax nst)) ll))
    
12.       (setq ll (cons (MAPCAR '(LAMBDA (x) (cons nst x)) (bb (1+ nst) nmax (1- n))) ll))
    
13.       )
    
14.     (setq nst (1+ nst))
    
15.     )
    
16.   (apply 'append ll)
    
17.   )
    
18. (defun asdf ( / li )
    
19.   (princ "\n===li===\n")
    
20.   (princ (setq li (vl-sort (MAPCAR '(LAMBDA (x) (vl-sort x '<)) (bb 1 20 4)) '(LAMBDA (x y) (< (car x) (car y))))))
    
21.   (princ "\n===length===\n")
    
22.   (princ (length li))
    
23.   )

(defun aa ( nmax nst / li )<br />   (repeat (- nmax nst)<br />     (setq li (cons (setq nst (1+ nst)) li))<br />     )<br />   (REVERSE li)<br />   )<br /> (defun bb ( nst nmax n / ll )<br />   (while (< nst nmax)<br />     (if (= n 2)<br />       (setq ll (cons (MAPCAR '(LAMBDA (x) (cons nst (if (listp x) x (list x)))) (aa nmax nst)) ll))<br />       (setq ll (cons (MAPCAR '(LAMBDA (x) (cons nst x)) (bb (1+ nst) nmax (1- n))) ll))<br />       )<br />     (setq nst (1+ nst))<br />     )<br />   (apply 'append ll)<br />   )<br /> (defun asdf ( / li )<br />   (princ "\n===li===\n")<br />   (princ (setq li (vl-sort (MAPCAR '(LAMBDA (x) (vl-sort x '<)) (bb 1 20 4)) '(LAMBDA (x y) (< (car x) (car y))))))<br />   (princ "\n===length===\n")<br />   (princ (length li))<br />   )

云中孤鹰

多谢楼主分享

xiaxiang

这个程序是干嘛的好歹介绍一下啊

kwok

不知怎么用呢，有个例就好了或是演视图.

328302216

多谢楼主分享！用上了！

feng582304

328302216 发表于 2014-9-24 16:40
多谢楼主分享！用上了！

这也用上了？！什么情况，分享一下！

flowerson

楼主 可否给个例子 这样回看得明白点。

dadiban

(aa 10 2)得到(3 4 5 6 7 8 9 10)

(bb 2 10 4)得到((2 8 9 10) (2 7 9 10) (2 7 8 9) (2 7 8 10) (2 6 9 10) (2 6 8 9) (2 6 8 10) (2 6 7 8) (2 6 7 9) (2 6 7 10) (2 5 9 10) (2 5 8 9) (2 5 8 10) (2 5 7 8) (2 5 7 9) (2 5 7 10) (2 5 6 7) (2 5 6 8) (2 5 6 9) (2 5 6 10) (2 4 9 10) (2 4 8 9) (2 4 8 10) (2 4 7 8) (2 4 7 9) (2 4 7 10) (2 4 6 7) (2 4 6 8) (2 4 6 9) (2 4 6 10) (2 4 5 6) (2 4 5 7) (2 4 5 8) (2 4 5 9) (2 4 5 10) (2 3 9 10) (2 3 8 9) (2 3 8 10) (2 3 7 8) (2 3 7 9) (2 3 7 10) (2 3 6 7) (2 3 6 8) (2 3 6 9) (2 3 6 10) (2 3 5 6) (2 3 5 7) (2 3 5 8) (2 3 5 9) (2 3 5 10) (2 3 4 5) (2 3 4 6) (2 3 4 7) (2 3 4 8) (2 3 4 9) (2 3 4 10) (3 8 9 10) (3 7 9 10) (3 7 8 9) (3 7 8 10) (3 6 9 10) (3 6 8 9) (3 6 8 10) (3 6 7 8) (3 6 7 9) (3 6 7 10) (3 5 9 10) (3 5 8 9) (3 5 8 10) (3 5 7 8) (3 5 7 9) (3 5 7 10) (3 5 6 7) (3 5 6 8) (3 5 6 9) (3 5 6 10) (3 4 9 10) (3 4 8 9) (3 4 8 10) (3 4 7 8) (3 4 7 9) (3 4 7 10) (3 4 6 7) (3 4 6 8) (3 4 6 9) (3 4 6 10) (3 4 5 6) (3 4 5 7) (3 4 5 8) (3 4 5 9) (3 4 5 10) (4 8 9 10) (4 7 9 10) (4 7 8 9) (4 7 8 10) (4 6 9 10) (4 6 8 9) (4 6 8 10) (4 6 7 8) (4 6 7 9) (4 6 7 10) (4 5 9 10) (4 5 8 9) (4 5 8 10) (4 5 7 8) (4 5 7 9) (4 5 7 10) (4 5 6 7) (4 5 6 8) (4 5 6 9) (4 5 6 10) (5 8 9 10) (5 7 9 10) (5 7 8 9) (5 7 8 10) (5 6 9 10) (5 6 8 9) (5 6 8 10) (5 6 7 8) (5 6 7 9) (5 6 7 10) (6 8 9 10) (6 7 9 10) (6 7 8 9) (6 7 8 10) (7 8 9 10))