Initial data commit
This commit is contained in:
parent
72d218235f
commit
f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
26
Task/Happy-numbers/JavaScript/happy-numbers-1.js
Normal file
26
Task/Happy-numbers/JavaScript/happy-numbers-1.js
Normal file
|
|
@ -0,0 +1,26 @@
|
|||
function happy(number) {
|
||||
var m, digit ;
|
||||
var cycle = [] ;
|
||||
|
||||
while(number != 1 && cycle[number] !== true) {
|
||||
cycle[number] = true ;
|
||||
m = 0 ;
|
||||
while (number > 0) {
|
||||
digit = number % 10 ;
|
||||
m += digit * digit ;
|
||||
number = (number - digit) / 10 ;
|
||||
}
|
||||
number = m ;
|
||||
}
|
||||
return (number == 1) ;
|
||||
}
|
||||
|
||||
var cnt = 8 ;
|
||||
var number = 1 ;
|
||||
|
||||
while(cnt-- > 0) {
|
||||
while(!happy(number))
|
||||
number++ ;
|
||||
document.write(number + " ") ;
|
||||
number++ ;
|
||||
}
|
||||
60
Task/Happy-numbers/JavaScript/happy-numbers-2.js
Normal file
60
Task/Happy-numbers/JavaScript/happy-numbers-2.js
Normal file
|
|
@ -0,0 +1,60 @@
|
|||
(() => {
|
||||
|
||||
// isHappy :: Int -> Bool
|
||||
const isHappy = n => {
|
||||
const f = n =>
|
||||
foldl(
|
||||
(a, x) => a + raise(read(x), 2), // ^2
|
||||
0,
|
||||
splitOn('', show(n))
|
||||
),
|
||||
p = (s, n) => n === 1 ? (
|
||||
true
|
||||
) : member(n, s) ? (
|
||||
false
|
||||
) : p(
|
||||
insert(n, s), f(n)
|
||||
);
|
||||
return p(new Set(), n);
|
||||
};
|
||||
|
||||
// GENERIC FUNCTIONS ------------------------------------------------------
|
||||
|
||||
// enumFromTo :: Int -> Int -> [Int]
|
||||
const enumFromTo = (m, n) =>
|
||||
Array.from({
|
||||
length: Math.floor(n - m) + 1
|
||||
}, (_, i) => m + i);
|
||||
|
||||
// filter :: (a -> Bool) -> [a] -> [a]
|
||||
const filter = (f, xs) => xs.filter(f);
|
||||
|
||||
// foldl :: (b -> a -> b) -> b -> [a] -> b
|
||||
const foldl = (f, a, xs) => xs.reduce(f, a);
|
||||
|
||||
// insert :: Ord a => a -> Set a -> Set a
|
||||
const insert = (e, s) => s.add(e);
|
||||
|
||||
// member :: Ord a => a -> Set a -> Bool
|
||||
const member = (e, s) => s.has(e);
|
||||
|
||||
// read :: Read a => String -> a
|
||||
const read = JSON.parse;
|
||||
|
||||
// show :: a -> String
|
||||
const show = x => JSON.stringify(x);
|
||||
|
||||
// splitOn :: String -> String -> [String]
|
||||
const splitOn = (cs, xs) => xs.split(cs);
|
||||
|
||||
// raise :: Num -> Int -> Num
|
||||
const raise = (n, e) => Math.pow(n, e);
|
||||
|
||||
// take :: Int -> [a] -> [a]
|
||||
const take = (n, xs) => xs.slice(0, n);
|
||||
|
||||
// TEST -------------------------------------------------------------------
|
||||
return show(
|
||||
take(8, filter(isHappy, enumFromTo(1, 50)))
|
||||
);
|
||||
})()
|
||||
1
Task/Happy-numbers/JavaScript/happy-numbers-3.js
Normal file
1
Task/Happy-numbers/JavaScript/happy-numbers-3.js
Normal file
|
|
@ -0,0 +1 @@
|
|||
[1, 7, 10, 13, 19, 23, 28, 31]
|
||||
71
Task/Happy-numbers/JavaScript/happy-numbers-4.js
Normal file
71
Task/Happy-numbers/JavaScript/happy-numbers-4.js
Normal file
|
|
@ -0,0 +1,71 @@
|
|||
(() => {
|
||||
|
||||
// isHappy :: Int -> Bool
|
||||
const isHappy = n => {
|
||||
const f = n =>
|
||||
foldl(
|
||||
(a, x) => a + raise(read(x), 2), // ^2
|
||||
0,
|
||||
splitOn('', show(n))
|
||||
),
|
||||
p = (s, n) => n === 1 ? (
|
||||
true
|
||||
) : member(n, s) ? (
|
||||
false
|
||||
) : p(
|
||||
insert(n, s), f(n)
|
||||
);
|
||||
return p(new Set(), n);
|
||||
};
|
||||
|
||||
// GENERIC FUNCTIONS ------------------------------------------------------
|
||||
|
||||
// filter :: (a -> Bool) -> [a] -> [a]
|
||||
const filter = (f, xs) => xs.filter(f);
|
||||
|
||||
// foldl :: (b -> a -> b) -> b -> [a] -> b
|
||||
const foldl = (f, a, xs) => xs.reduce(f, a);
|
||||
|
||||
// insert :: Ord a => a -> Set a -> Set a
|
||||
const insert = (e, s) => s.add(e);
|
||||
|
||||
// member :: Ord a => a -> Set a -> Bool
|
||||
const member = (e, s) => s.has(e);
|
||||
|
||||
// read :: Read a => String -> a
|
||||
const read = JSON.parse;
|
||||
|
||||
// show :: a -> String
|
||||
const show = x => JSON.stringify(x);
|
||||
|
||||
// splitOn :: String -> String -> [String]
|
||||
const splitOn = (cs, xs) => xs.split(cs);
|
||||
|
||||
// raise :: Num -> Int -> Num
|
||||
const raise = (n, e) => Math.pow(n, e);
|
||||
|
||||
// until :: (a -> Bool) -> (a -> a) -> a -> a
|
||||
const until = (p, f, x) => {
|
||||
let v = x;
|
||||
while (!p(v)) v = f(v);
|
||||
return v;
|
||||
};
|
||||
|
||||
// TEST -------------------------------------------------------------------
|
||||
return show(
|
||||
until(
|
||||
m => m.xs.length === 8,
|
||||
m => {
|
||||
const n = m.n;
|
||||
return {
|
||||
n: n + 1,
|
||||
xs: isHappy(n) ? m.xs.concat(n) : m.xs
|
||||
};
|
||||
}, {
|
||||
n: 1,
|
||||
xs: []
|
||||
}
|
||||
)
|
||||
.xs
|
||||
);
|
||||
})();
|
||||
1
Task/Happy-numbers/JavaScript/happy-numbers-5.js
Normal file
1
Task/Happy-numbers/JavaScript/happy-numbers-5.js
Normal file
|
|
@ -0,0 +1 @@
|
|||
[1, 7, 10, 13, 19, 23, 28, 31]
|
||||
Loading…
Add table
Add a link
Reference in a new issue