recursive
[LeetCode] - happy number
Write an algorithm to determine if a number n 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. 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. R..
[LeetCode] Path Sum
링크 leetcode.com/problems/path-sum/ Path Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum. A leaf is a no..
[LeetCode] Fibonacci number (피보나치 수열)
LeetCode 문제 링크 leetcode.com/problems/fibonacci-number/ Fibonacci Number - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 피보나치 수열 계산기 (100까지) ko.numberempire.com/fibonaccinumbers.php 피보나치 수열 생성기 피보나치 수열 생성기 ko.numberempire.com 대표적인 재귀함수를 사용하는 문제이다. ko.wikipedia.org/wiki/%ED%94%BC%E..