《leetCode》：Happy Number

题目

Write an algorithm to determine if a number is "happy".

A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those numbers for which this process ends in 1 are happy numbers.

Example: 19 is a happy number

1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1

思路

此题比较简单，就是不停的将数字的每位进行平方求和并累加，判断其是否等于1；值得注意的是，要判断是否产生了循环。判断是否产生了循环的方法就是：将中间结果进行保存，并每次查看中间结果中是否出现了此值；并不能将新的结果只与原始值进行相等比较来判断是否产生了循环。

实现代码如下：

//函数的功能：求数字各位上面的和 
int everyDigitSquareSum(int n){
    if(n<0){
        return 0;
    } 
    int sum=0;
    while(n){
        int remainder=n%10;
        sum+=(remainder*remainder);
        n/=10;
    }
    return sum;
}
#define N 10000
//函数的功能：检查数组中是否存在target这个数 
bool isExist(int *nums,int numsSize,int target){
    if(nums==NULL||numsSize<1){
        return false;
    } 
    for(int i=0;i<numsSize;i++){
        if(nums[i]==target){
            return true;
        }
    }
    return false;
}
bool isHappy(int n) {
    if(n<0){
        return 0;
    }
    int *value=(int *)malloc(N*sizeof(int));
    if(value==NULL){
        exit(EXIT_FAILURE);
    }
    int index=0;
    while(n!=1){
        value[index++]=n;
        n=everyDigitSquareSum(n);       
        if(isExist(value,index,n)){//造成了循环，返回false 
            return false;
        }
    }
    return true;
}