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

12 + 92 = 82
82 + 22 = 68
62 + 82 = 100
12 + 02 + 02 = 1

class Solution {
public:
    bool isHappy(int n) {
    int k=0,m=n,count=0;
    vector<int>vec;
     vector<int>::iterator result;
     while(m!=1)
    {
        result = find( vec.begin(), vec.end(),count); //查找
        if ( result != vec.end())//找到了 
            return false;
        else 
         {
            vec.push_back(count);
             count=0;
             while(m>0)
             {
                 count += (m%10)*(m%10);//开始这里弄错了
                 m /= 10;
             }
             m=count;
        }
    }
    return true;
    }
};