I am trying to remove members which exists in a string from a list consisting of those members. Example:
I tried an example where we need to pass a list as arguments and if condition succeeds I want to add result to a new list.
So I need to calculate the longest common subsequence of two lists, but it needs to be in polynomial time. The only problem i\'m having is that I\'m n开发者_如何学JAVAot allowed to use \"!\" at all. T
I want to learn some language from Lisp family. It may be CL or Scheme and try to use it for web programming. Just for fun. I have significant C++ experience (prefessional development).
I found this code for zipping in Scheme: (define zip (lambda (leftList rightList) (if (null? rightList)
Im trying count the number of positive elements in a list.Here is what I have so far: (define howMany
This question already has answ开发者_Go百科ers here: Closed 12 years ago. Possible Duplicate: Is Clojure closer to Scheme or Common Lisp from a beginner's perspective?
In the book \"IronPython in Action,\" the author states that IronPython, unlike CPython, benefits from certain optimizations, both in the JIT and in the framework itself, that CPython cannot take adva
While attempting to generate a list of subsets that exist within two sets, I am running into an issue with cons. A procedure takes in a list named result and attempts to construct a new list out of re
While 开发者_JAVA技巧trying to write a solution to the longest common sublist problem in Scheme, I\'m having trouble figuring out what is wrong with what I have so far.I think it\'s the right idea and
加载中,请稍侯......