Lisp recursive function, return list

Question

know this is a newbie question I apologize in advance. I'm writing a recursive function which returns the number of 'o in a given list

(defun garde-o (liste)
    (cond
        ((not liste) 0) 
        ((equal (car liste) 'o)  (+ 1 (garde-o(cdr liste)))   )
        ((garde-o(cdr liste))  )
    )
)

Instead of returning the number of occurence I would like to return the given list with only the 'o.

Like that:

(garde-o '(a o x & w o o)) should return => (o o o)

I don't want to use pop,push,set... just I can't find of to return this.

You should avoid re-asking question if down voted earlier. Correct your question and someone will help you. You have already posted :stackoverflow.com/questions/28494515/… — Pankaj Sejwal
– Pankaj Sejwal, Commented Feb 13, 2015 at 9:45

Paul Richter · Accepted Answer · 2015-02-13 08:12:50Z

1

Your current version returns a number which is incremented on each recursion. So your proposed version should work by building a list, extending it on each recursion.

Replace 0 with ‘(), and + 1 with cons ‘o.

answered Feb 13, 2015 at 8:12

Paul Richter

6,3512 gold badges22 silver badges25 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Pankaj Sejwal · Accepted Answer · 2015-02-13 09:42:09Z

0

You are very close,

(defun garde-o (liste)
 (cond ((not liste) nil)
  ((equal (car liste) 'o) (cons (car liste) (garde-o (cdr liste))))
  ((garde-o (cdr liste)))))

Usage: (garde-o '(a o x & w o )) => ( o o )

You just need to pick on your identified car.

answered Feb 13, 2015 at 9:42

Pankaj Sejwal

1,5951 gold badge18 silver badges28 bronze badges

Collectives™ on Stack Overflow

Lisp recursive function, return list

2 Answers 2

Comments

Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related