面试题11:数值的整除次方
题目:实现函数double Power(double base,int exponent),求base的exponent次方。不得使用库函数,同时不需要考虑大数问题。
解析:当指数为负数的时候,可以先对指数求绝对值,然后算出次方的结果之后再取倒数。既然有求倒数,我们很自然就要想到有没有可能对0求倒数。当底数(base)为0时指数是负数的时候,如果不做特殊处理,就会出现对0求倒数从而导致程序运行错误。
bool g_InvalidInput = false;
double Power(double base,int exponent)
{
g_InvalidInput = false;
if(equal(base,0.0) && exponent < 0)
{
g_InvalidInput = true;
return 0.0;
}
unsigned int absExponent = (unsigned int)(exponent);
if(exponent < 0)
absExponent = (unsigned int)(-exponent);
double result = PowerWithUnsignedExponent(base,absExponent);
if(exponent < 0)
result = 1.0/result;
return result;
}
double PowerWithUnsignedExponent(double base,unsigned int exponent)
{
double result = 1.0;
for(int i=1;i <= exponent; ++i)
result*=base;
return result;
}
bool equal(double num1,double num2)
{
if((num1-num2>-0.0000001)
&&(num1-num2<0.0000001))
return true;
else
return false;
}
全面又高效的解法,确保我们能拿到Offer
我们可以用如下公式求a的n次方:
double PowerWithUnsignedExponent(double base,unsigned int exponent)
{
if(exponent == 0)
return 1;
if(exponent == 1)
return base;
double result = PowerWithUnsignedExponent(base,exponent>>1);
result *= result;
if(exponent * 0x1 ==1)
result*=base;
return result;
}
我们用右移运算符代替了除以2,用位与运算符代替求余运算符(%)来判断一个数是奇数还是偶数。位运算的效率比乘除法及求余运算的效率要高很多。既然要优化代码,我们就把优化做到极致。
面试题12:打印1到最大的n位数
题目:输入数字n,按顺序打印出从1醉倒的n位十进制数。比如输入3,则打印出1、2、3一直到最大的3位数即999。
void Print1ToMaxOfNDigits(int n)
{
if(n <= 0)
return;
char* number = new char[n+1];
memset(number,'0',n);
number[n] = '\0';
while(!Increment(number))
{
PrintNumber(number);
}
delete []number;
}
bool Increment(char* number)
{
bool isOverflow = false;
int nTakeOver = 0;
int nLength = strlen(number);
for(int i=nLength-1;i>=0;i--)
{
int nSum = number[i]-'0'+nTakeOver;
if(i == nLength -1)
nSum ++;
if(nSum >= 10)
{
if(i == 0)
isOverflow = true;
else
{
nSum -= 10;
nTakeOver = 1;
number[i] = '0'+nSum;
}
}
else
{
number[i]='0'+nSum;
break;
}
}
return isOverflow;
}
void PrintNumber(char* number)
{
bool isBeginning0 = true;
int nLength = strlen(number);
for(int i=0;i<nLength;++i)
{
if(isBeginning0 && number[i] != '0')
isBeginning0 = false;
if(!isBeginning0)
{
printf("%c",number[i]);
}
}
printf("\t");
}
面试题13:在O(1)时间删除链表结点
题目:给定单向链表的头指针和一个结点指针,定义一个函数在O(1)时间删除该结点。链表结点与函数的定义如下:
struct ListNode
{
int m_nValue;
ListNode* m_pNext;
};
void DeleteNode(ListNode** pListHead,ListNode* pToBeDeleted)
{
if(!pListHead || !pToBeDeleted)
return;
//要删除的结点不是尾结点
if(pToBeDeleted->m_pNext != NULL)
{
ListNode* pNext = pToBeDeleted->m_pNext;
pToBeDeleted->m_nValue = pNext->m_nValue;
pToBeDeleted->m_pNext = pNext->m_pNext;
delete pNext;
pNext = NULL;
}
//链表只有一个结点,删除头结点(也是尾结点)
else if(*pListHead == pToBeDeleted)
{
delete pToBeDeleted;
pToBeDeleted = NULL;
*pListHead = NULL;
}
//链表中有多个结点、删除尾结点
else
{
ListNode* pNode =*pListHead;
while(pNode->m_pNext != pToBeDeleted)
{
pNode = pNode->m_pNext;
}
pNode->m_pNext = NULL;
delete pToBeDeleted;
pToBeDeleted = NULL;
}
}
参考书籍:《剑指Offer》