Additional snippets

This commit is contained in:
Angelos Chalaris
2017-11-30 19:12:13 +02:00
parent 292aad75bc
commit bb40a7ec08
9 changed files with 113 additions and 0 deletions

View File

@ -0,0 +1,9 @@
## RGB to hexadecimal
Convert each value to a hexadecimal string, using `toString(16)`, then `padStart(2,'0')` to get a 2-digit hexadecimal value.
Combine values using `join('')`.
```js
var rgbToHex = (r, g, b) =>
[r.toString(16).padStart(2,'0') , g.toString(16).padStart(2,'0') , b.toString(16).padStart(2,'0')].join('');
```

View File

@ -0,0 +1,8 @@
### Even or odd number
Use `Math.abs()` to extend logic to negative numbers, check using the modulo (`%`) operator.
Return `true` if the number is even, `false` if the number is odd.
```js
var isEven = num => Math.abs(num) % 2 === 0;
```

View File

@ -0,0 +1,9 @@
## Greatest common divisor (GCD)
Use recursion.
Base case is when `y` equals `0`. In this case, return `x`.
Otherwise, return the GCD of `y` and the remainder of the division `x/y`.
```js
var gcd = (x , y) => !y ? x : gcd(y, x % y);
```

View File

@ -0,0 +1,8 @@
### Sum of array of numbers
Use `reduce()` to add each value to an accumulator, initialized with a value of `0`.
```js
var sum = arr =>
arr.reduce( (acc , val) => acc + val, 0);
```

View File

@ -0,0 +1,13 @@
### Unique values of array
Use `reduce()` to accumulate all unique values in an array.
Check if each value has already been added, using `indexOf()` on the accumulator array.
```js
var uniqueValues = arr =>
arr.reduce( (acc, val) => {
if(acc.indexOf(val) === -1)
acc.push(val);
return acc;
}, []);
```