Ones and Zeros (7 KYU):
Given an array of one's and zero's convert the equivalent binary value to an integer.
link
Here is a C# version
Note: Aggregate is equivalent to reduce in JavaScript or other languages and seed value is the first argument unlike in JavaScript, in which it's the last argument.
Aggregate
reduce
seed
using System; using System.Linq; namespace Solution { class Kata { public static int binaryArrayToNumber(int[] a) { return Convert.ToInt32(a.Aggregate("", (acc, n) => acc + n.ToString()), 2); } } }
F#
Edit: shortened
let update value (sum, mult) = sum + (value * mult), mult * 2 // usage, processes array right to left let (sum, _) = Array.foldBack update inputArr (0,1)
Common Lisp again:
(setf bits '(1 0 0 0)) ;; or something (reduce (lambda (x y) (+ (* 2 x) y)) bits)
Output:
8
This is entirely type-agnostic and will not overflow for large input arrays.
#! /usr/bin/perl use warnings; use strict; sub bin2int { my ($i, $r); $r += 2 ** $i++ * pop while @_; return $r } use Test::More tests => 9; is bin2int(0, 0, 0, 1), 1; is bin2int(0, 0, 1, 0), 2; is bin2int(0, 1, 0, 1), 5; is bin2int(1, 0, 0, 1), 9; is bin2int(0, 0, 1, 0), 2; is bin2int(0, 1, 1, 0), 6; is bin2int(1, 1, 1, 1), 15; is bin2int(1, 0, 1, 1), 11; is bin2int((1) x 20), 2 ** 20 - 1;
My Python solution:
def binary_array_to_number(arr): return int(''.join(str(i) for i in arr), 2)
This will cause problems on Python 2 where int has a maximum value which is easily exceeded.
int
true -- I'm on Python 3 though and the test cases are all small
"Nobody will notice" is a developer's worst enemy. ;-)
Q/kdb+ solution (let l be the input list):
with list multiplication:
sum l * 2 xexp reverse til count l
with adverb over:
{y + 2*x} over l
Plain JS:
function arrayToInt (arr) { return Number.parseInt(arr.join(""), 2); }
const binaryArrayToNumber = arr => { return parseInt(arr.join(''), 2); };
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Tuesday
Ones and Zeros (7 KYU):
Given an array of one's and zero's convert the equivalent binary value to an integer.
link
Here is a C# version
Note:
Aggregate
is equivalent toreduce
in JavaScript or other languagesand
seed
value is the first argument unlike in JavaScript, in which it's the last argument.F#
Edit: shortened
Common Lisp again:
Output:
This is entirely type-agnostic and will not overflow for large input arrays.
My Python solution:
This will cause problems on Python 2 where
int
has a maximum value which is easily exceeded.true -- I'm on Python 3 though and the test cases are all small
"Nobody will notice" is a developer's worst enemy. ;-)
Q/kdb+ solution (let l be the input list):
with list multiplication:
with adverb over:
Plain JS: