Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- function solve(array) {
- let arr = array
- let arrL = array.length
- let repeatCount = 1
- let repeatNum
- let repeatBest = 1
- let repeatNumTop = 0
- for (let i = 0; i < arrL; i++) {
- let currentNum = arr[i]
- let nextNum = arr[i + 1]
- if (currentNum !== nextNum) {
- repeatCount = 1
- }
- if (currentNum === nextNum) {
- repeatCount++
- repeatNum = currentNum
- if (repeatCount > repeatBest) {
- repeatBest = repeatCount
- repeatNumTop = repeatNum
- }
- }
- }
- repeatNumTop+=" "
- let result = repeatNumTop.repeat(repeatBest)
- console.log(result)
- }
- solve([2, 1, 1, 2, 3, 3, 2, 2, 2, 3, 3, 1])
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement