优化原题解，添加部分题目

problems/0202.快乐数.md

@@ -338,53 +338,6 @@ static inline int calcSquareSum(int num) {
     return sum;
 }
 
-#define HASH_TABLE_SIZE     (32)
-
-bool isHappy(int n){
-    int sum = n;
-    int index = 0;
-    bool bHappy = false;
-    bool bExit = false;
-    /* allocate the memory for hash table with chaining method*/
-    HashNode ** hashTable = (HashNode **)calloc(HASH_TABLE_SIZE, sizeof(HashNode));
-    
-    while(bExit == false) {
-        /* check if n has been calculated */
-        index = hash(n, HASH_TABLE_SIZE);
-
-        HashNode ** p = hashTable + index;
-
-        while((*p) && (bExit == false)) {
-            /* Check if this num was calculated, if yes, this will be endless loop */
-            if((*p)->key == n) { 
-                bHappy = false;
-                bExit = true;
-            }
-            /* move to next node of the same index */
-            p = &((*p)->next);
-        }
-
-        /* put n intot hash table */
-        HashNode * newNode = (HashNode *)malloc(sizeof(HashNode));
-        newNode->key = n;
-        newNode->next = NULL;
-
-        *p = newNode;
-
-        sum = calcSquareSum(n);
-        if(sum == 1) {
-            bHappy = true;
-            bExit = true;
-        }
-        else {
-            n = sum;
-            
-        }
-    }
-
-    return bHappy;
-}
-```
 
 Scala:
 ```scala