// 面试题10:斐波那契数列
// 题目:写一个函数,输入n,求斐波那契(Fibonacci)数列的第n项。
方法一:递归
递归:
#include <iostream>
using namespace std;
// recursion
long long Fibonacci_recursion(unsigned int n)
{
if (n == 0 or n == 1)
return n;
return Fibonacci_recursion(n - 1) + Fibonacci_recursion(n - 2);
}
尾递归(优化):
//tail recursion
#include <iostream>
using namespace std;
long long Fibonacci(unsigned n, unsigned res_0 = 0, unsigned res_1 = 1)
{
if (n == 0)
return res_0;
else
return Fibonacci(n - 1, res_1, res_0 + res_1);
}
方法二:循环
//loop
long long Fibonacci_loop(unsigned int n)
{
if (n == 0 or n == 1)
return n;
long long first_num = 0, second_num = 1, third_num = 0;
for (unsigned int i = 2; i <= n; i++)
{
third_num = first_num + second_num;
first_num = second_num;
second_num = third_num;
}
return second_num;
}
// 面试题21:调整数组顺序使奇数位于偶数前面
// 题目:输入一个整数数组,实现一个函数来调整该数组中数字的顺序,使得所有
// 奇数位于数组的前半部分,所有偶数位于数组的后半部分。
method 1: 遇到偶数,计数k加一,遇到奇数,与前k个数互换,就能把偶数全部放到后面去。
void Ajust_array_order(int *numbers, int length)
{
if (numbers == NULL || length == 0)
{
return;
}
int *p_begin = numbers;
int num_of_even = 0;
int temp = 0;
for (int i = 0; i < length; i++)
{
if (numbers[i] % 2 == 0)
num_of_even ++;
else
{
temp = numbers[i];
numbers[i] = numbers[i - num_of_even];
numbers[i - num_of_even] = temp;
}
}
}
method 2: 双指针,把后面的偶数与前面的奇数互换
void ReorderOddEven_1(int* pData, unsigned int length)
{
if (pData == NULL || length == 0)
{
return;
}
int* pBegin = pData;
int* pEnd = pData + length - 1;
while (pBegin < pEnd)
{
while (pBegin < pEnd && (*pBegin & 0x1) != 0) // 向后移动pBegin,直到它指向偶数
/*与16进制的1,相当于与pBegin最右边的二进制数进行与操作,如果结果为0,则为偶数*/
{
pBegin++;
}
while (pBegin < pEnd && (*pEnd & 0x1) == 0) // 向前移动pEnd,直到它指向奇数
{
pEnd--;
}
if (pBegin < pEnd)
{
int temp = *pBegin;
*pBegin = *pEnd;
*pEnd = temp;
}
}
}
测试代码:
void Print_array(int* numbers, int length)
{
for (int i = 0; i < length; i++)
{
cout << numbers[i] <<" ";
}
cout << endl;
}
int main()
{
int numbers[] = { 2, 4, 6, 1, 3, 5, 7 };
int length = sizeof(numbers) / sizeof(numbers[0]);
Ajust_array_order(numbers, length);
Print_array(numbers, length);
return 0;
}