LeetCode 202

// 2015.5.20
// Happy Number
// 可惜LeetCode里面不能使用用hash_set

//自己写了个简单的hasn_table

//LeetCode Time 0ms;

#include <iostream>
#include <hash_set>


#define HashEX 3
#define HashLength   8
#define Modulu 7


struct ListNode 
{
ListNode(int val) : value(val), pNext(0){}
int value;
ListNode* pNext;
};


struct HashNode
{
HashNode() :value(-1), pHead(0){}
int value;
ListNode* pHead;
};


class Solution 
{
public:
bool isHappy(int n) 
  {
HashNode HashTable[HashLength]; 


HashTable[hashFunction(n)].value = n;


while(1)
{
n = decompose(n);
if (n == 1)
return true;
else if(findAndInsert(HashTable, n))
return false;
}
}

inline int decompose(int n)
{
int Sum = 0;
while (n >= 10)
{
int Remainder = n % 10;
Sum += Remainder * Remainder;
n /= 10;
}
Sum += n * n;
return Sum;
}


inline int hashFunction(int n)
  {
n = n & Modulu;
return n;
}


inline bool findAndInsert(HashNode* pHashTable, int n)
{
int Index = hashFunction(n);
  if (pHashTable[Index].value == -1)
{
pHashTable[Index].value = n;
return false;
}
else
{
ListNode** pTemp = &pHashTable[Index].pHead;
while(*pTemp)
{
if ((*pTemp)->value == n)
return true;
else
*pTemp = (*pTemp)->pNext;
}

*pTemp = new ListNode(n);
return false;
}
}
};