Clojure Дать описание фрагмента программы, в котором определяется количество нечетных, отрицательных четных и прочих элементов - JVM - Ответ 6099913

(defun task (lst)
  (let* ((num-odd (length (remove-if-not #'oddp lst)))
         (num-neg-even (length (remove-if-not #'(lambda (x) (and (minusp x) (evenp x))) lst)))
         (num-other (- (length lst) num-odd num-neg-even)))
    (list num-odd num-neg-even num-other)))
 
==> task
 
(task '(1 2 3 -1 -2 -3))
 
==> (4 1 1)

(defun task (lst &optional (num-odd 0) (num-neg-even 0) (num-other 0))
  (cond ((null lst) (list num-odd num-neg-even num-other))
        ((oddp (car lst)) (task (cdr lst) (+ 1 num-odd) num-neg-even num-other))
        ((and (evenp (car lst)) (minusp (car lst))) (task (cdr lst) num-odd (+ 1 num-neg-even) num-other))
        (t (task (cdr lst) num-odd num-neg-even (+ 1 num-other)))))
 
 
==> task
 
(task '(1 2 3 -1 -2 -3))
 
==> (4 1 1)

(defun task (lst)
  (let ((num-odd 0)
        (num-neg-even 0)
        (num-other 0))
    (dolist (i lst (list num-odd num-neg-even num-other))
        (cond ((oddp i) (setq num-odd (+ 1 num-odd)))
              ((and (evenp i) (minusp i)) (setq num-neg-even (+ 1 num-neg-even)))
              (t (setq num-other (+ 1 num-other))))))) 
 
==> task
 
(task '(1 2 3 -1 -2 -3))
 
==> (4 1 1)