Title: #842 - Split Array into Fibonacci Sequence - LeetCode JavaScript Solutions
Open Graph Title: #842 - Split Array into Fibonacci Sequence - LeetCode JavaScript Solutions
X Title: #842 - Split Array into Fibonacci Sequence - LeetCode JavaScript Solutions
Description: You are given a string of digits num, such as "123456579". We can split it into a Fibonacci-like sequence [123, 456, 579]. Formall...
Open Graph Description: You are given a string of digits num, such as "123456579". We can split it into a Fibonacci-like sequence [123, 456, 579]. Formall...
X Description: You are given a string of digits num, such as "123456579". We can split it into a Fibonacci-like sequence [123, 456, 579]. Formall...
Keywords:
Opengraph URL: https://leetcodejavascript.com/solutions/split-array-into-fibonacci-sequence
Domain: leetcodejavascript.com
{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/split-array-into-fibonacci-sequence","name":"#842 - Split Array into Fibonacci Sequence - LeetCode JavaScript Solutions","description":"You are given a string of digits num, such as "123456579". We can split it into a Fibonacci-like sequence [123, 456, 579]. Formall...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} num\n * @return {number[]}\n */\nvar splitIntoFibonacci = function(num) {\n const result = [];\n const MAX_INT = 2 ** 31 - 1;\n backtrack(0);\n return result;\n\n function backtrack(index) {\n if (index === num.length && result.length >= 3) return true;\n for (let length = 1; length <= num.length - index; length++) {\n if (num[index] === '0' && length > 1) break;\n const current = parseInt(num.substring(index, index + length));\n if (current > MAX_INT) break;\n if (result.length >= 2) {\n const sum = result[result.length - 1] + result[result.length - 2];\n if (current > sum) break;\n if (current < sum) continue;\n }\n result.push(current);\n if (backtrack(index + length)) return true;\n result.pop();\n }\n return false;\n }\n};","keywords":"LeetCode 842, #842 - Split Array into Fibonacci Sequence, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}
| author | LeetCodeJavascript.com |
| og:type | article |
| og:image | https://leetcodejavascript.com/og-image.jpg |
| og:site_name | LeetCode JavaScript Solutions |
| twitter:card | summary_large_image |
| twitter:url | https://leetcodejavascript.com/solutions/split-array-into-fibonacci-sequence |
| twitter:image | https://leetcodejavascript.com/og-image.jpg |
| twitter:creator | @joshcrozier |
| theme-color | #1f2937 |
Links:
| LeetCodeJavascript.com | https://leetcodejavascript.com/ |
| Star on GitHub | https://github.com/JoshCrozier/leetcode-javascript |
| Back to all solutions | https://leetcodejavascript.com |
| View on LeetCode | https://leetcode.com/problems/split-array-into-fibonacci-sequence/ |
| View on GitHub | https://github.com/JoshCrozier/leetcode-javascript/blob/master/solutions/0842-split-array-into-fibonacci-sequence.js |
| String | https://leetcodejavascript.com/tags/string |
| Backtracking | https://leetcodejavascript.com/tags/backtracking |
| Josh Crozier | https://joshcrozier.com |
Viewport: width=device-width, initial-scale=1.0
Robots: index, follow