feat: add solutions to lc problem: No.0202

No.0202.Happy Number

Author: YangFong

solution/0200-0299/0202.Happy Number/README.md

@@ -154,6 +154,29 @@ func getSum(n int) (sum int) {
 
 ### **TypeScript**
 
+```ts
+function isHappy(n: number): boolean {
+    const getNext = (n: number) => {
+        let res = 0;
+        while (n !== 0) {
+            res += (n % 10) ** 2;
+            n = Math.floor(n / 10);
+        }
+        return res;
+    };
+    const set = new Set();
+    while (n !== 1) {
+        const next = getNext(n);
+        if (set.has(next)) {
+            return false;
+        }
+        set.add(next);
+        n = next;
+    }
+    return true;
+}
+```
+
 ```ts
 function isHappy(n: number): boolean {
     const getNext = (n: number) => {
@@ -177,6 +200,33 @@ function isHappy(n: number): boolean {
 
 ### **Rust**
 
+```rust
+use std::collections::HashSet;
+impl Solution {
+    fn get_next(mut n: i32) -> i32 {
+        let mut res = 0;
+        while n != 0 {
+            res += (n % 10).pow(2);
+            n /= 10;
+        }
+        res
+    }
+
+    pub fn is_happy(mut n: i32) -> bool {
+        let mut set = HashSet::new();
+        while n != 1 {
+            let next = Self::get_next(n);
+            if set.contains(&next) {
+                return false;
+            }
+            set.insert(next);
+            n = next;
+        }
+        true
+    }
+}
+```
+
 ```rust
 impl Solution {
     pub fn is_happy(n: i32) -> bool {
@@ -199,6 +249,29 @@ impl Solution {
 }
 ```
 
+### **C**
+
+```c
+int getNext(int n) {
+    int res = 0;
+    while (n) {
+        res += (n % 10) * (n % 10);
+        n /= 10;
+    }
+    return res;
+}
+
+bool isHappy(int n) {
+    int slow = n;
+    int fast = getNext(n);
+    while (slow != fast) {
+        slow = getNext(slow);
+        fast = getNext(getNext(fast));
+    }
+    return fast == 1;
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0202.Happy Number/README_EN.md

@@ -138,6 +138,29 @@ func getSum(n int) (sum int) {
 
 ### **TypeScript**
 
+```ts
+function isHappy(n: number): boolean {
+    const getNext = (n: number) => {
+        let res = 0;
+        while (n !== 0) {
+            res += (n % 10) ** 2;
+            n = Math.floor(n / 10);
+        }
+        return res;
+    };
+    const set = new Set();
+    while (n !== 1) {
+        const next = getNext(n);
+        if (set.has(next)) {
+            return false;
+        }
+        set.add(next);
+        n = next;
+    }
+    return true;
+}
+```
+
 ```ts
 function isHappy(n: number): boolean {
     const getNext = (n: number) => {
@@ -161,6 +184,33 @@ function isHappy(n: number): boolean {
 
 ### **Rust**
 
+```rust
+use std::collections::HashSet;
+impl Solution {
+    fn get_next(mut n: i32) -> i32 {
+        let mut res = 0;
+        while n != 0 {
+            res += (n % 10).pow(2);
+            n /= 10;
+        }
+        res
+    }
+
+    pub fn is_happy(mut n: i32) -> bool {
+        let mut set = HashSet::new();
+        while n != 1 {
+            let next = Self::get_next(n);
+            if set.contains(&next) {
+                return false;
+            }
+            set.insert(next);
+            n = next;
+        }
+        true
+    }
+}
+```
+
 ```rust
 impl Solution {
     pub fn is_happy(n: i32) -> bool {
@@ -183,6 +233,29 @@ impl Solution {
 }
 ```
 
+### **C**
+
+```c
+int getNext(int n) {
+    int res = 0;
+    while (n) {
+        res += (n % 10) * (n % 10);
+        n /= 10;
+    }
+    return res;
+}
+
+bool isHappy(int n) {
+    int slow = n;
+    int fast = getNext(n);
+    while (slow != fast) {
+        slow = getNext(slow);
+        fast = getNext(getNext(fast));
+    }
+    return fast == 1;
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0202.Happy Number/Solution.c

@@ -0,0 +1,18 @@
+int getNext(int n) {
+    int res = 0;
+    while (n) {
+        res += (n % 10) * (n % 10);
+        n /= 10;
+    }
+    return res;
+}
+
+bool isHappy(int n) {
+    int slow = n;
+    int fast = getNext(n);
+    while (slow != fast) {
+        slow = getNext(slow);
+        fast = getNext(getNext(fast));
+    }
+    return fast == 1;
+}