How can i solve integer overflow in Clojure?

Question

I am doing this exercise. Pascal's Trapezoid

My solution is:

(fn pascal[initseq]
  (let [gen-nextseq (fn [s]
                      (let [s1 (conj (vec s) 0)
                            s2 (cons 0 s)]
                        (map + s1 s2)))]
    (cons 
      initseq 
      (lazy-seq 
        (pascal 
          (gen-nextseq initseq))))))

I passed first three test cases, but failed the last one.

It says "java.lang.ArithmeticException: integer overflow"

So, is there a big integer in Clojure, or is there a better way to solve the problem?

Cubic · Accepted Answer · 2013-03-09 13:58:39Z

8

Change + to +'. That will automagically get you a clojure.lang.BigInt if the result doesn't fit into a long. You can also use the N suffix on literals to get a BigInt.

(class (+' 3 2)) ;=> java.lang.Long
(class (+' 300000000000000000000000000000 2)) ;=> clojure.lang.BigInt
(class 3N) ;=> clojure.lang.BigInt

answered Mar 9, 2013 at 13:58

Cubic

15.8k6 gold badges50 silver badges97 bronze badges

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

Comments

ntalbs · Accepted Answer · 2013-03-09 14:12:05Z

2

You can use +' instead of + for arbitrary precision.

(fn pascal[initseq]
  (let [gen-nextseq (fn [s]
                      (let [s1 (conj (vec s) 0)
                            s2 (cons 0 s)]
                        (map + s1 s2)))]
                             ^^
...

So you can modify the above marked potion of the code as follow.

                        (map +' s1 s2)))]

edited Mar 9, 2013 at 14:12

answered Mar 9, 2013 at 13:58

ntalbs

29.6k8 gold badges72 silver badges86 bronze badges

Collectives™ on Stack Overflow

How can i solve integer overflow in Clojure?

2 Answers 2

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related