問題
翻訳を表示Start with n. If it is even, divide it by 2; if it is odd, multiply it by 3 and add 1. Repeat until the value is 1. Include both the starting value and the final 1 in your answer.
Implement collatz_sequence(n).
Input
n: The positive starting integer.
Output
Return the complete sequence in order.
制約
1 ≤ n ≤ 10,000. Inputs in this range reach 1 under this rule; all sequence values fit a signed 64-bit integer.
例
例 1
入力：
n = 6
期待される出力：
expected = [6, 3, 10, 5, 16, 8, 4, 2, 1]入力：
long long n = 6;
期待される出力：
std::vector<long long> expected = {6, 3, 10, 5, 16, 8, 4, 2, 1};入力：
long n = 6;
期待される出力：
long[] expected = new long[] {6, 3, 10, 5, 16, 8, 4, 2, 1};解説
6 is even, so it becomes 3. Then 3 becomes 10. Continue applying the rule until 1.
例 2
入力：
n = 1
期待される出力：
expected = [1]入力：
long long n = 1;
期待される出力：
std::vector<long long> expected = {1};入力：
long n = 1;
期待される出力：
long[] expected = new long[] {1};解説
The starting value is already 1, so no transformations are needed.
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。