LeetCode обратное междовое решение
/**
* @param {number} x
* @return {number}
*/
var reverse = function(x) {
const toArr = String(x).split('')
const store = []
if(toArr.length > 0) {
toArr.forEach((val) => {
if(val !== 0 && val !== '-') {
store.push(val)
}
if(val === 0) {
store.push(val)
}
if(val !== 0 && val == '-') {
store.push('-')
}
})
}
let reverse = 0
if(store.includes('-')) {
reverse = - + store.reverse().join('').replace('-', '')
}
if(!store.includes('-')) {
reverse = store.reverse().join('').replace('-', '')
}
return parseInt(reverse)
};
Restu Wahyu Saputra
