{"push_id":666077571,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"db95f54d65316785e57c69567a64358b86239607","before":"d0ce44b6936d37779ffef4b74c92bad6cda62f4d","commits":[{"sha":"db95f54d65316785e57c69567a64358b86239607","author":{"email":"bdc981631ada839f0633c277f85f6f921d312ea0@intel.com","name":"rxm24217"},"message":"Write an algorithm to determine if a number is \"happy\".\n\nA 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.\n\nExample: 19 is a happy number\n\n12 + 92 = 82\n82 + 22 = 68\n62 + 82 = 100\n12 + 02 + 02 = 1","distinct":true,"url":"https://api.github.com/repos/lezasantaizi/leetcode/commits/db95f54d65316785e57c69567a64358b86239607"}]}