Leetcode 258. Add Digits

Compute the digital root of a nonnegative integer by repeatedly summing its digits until one digit remains; this reduces to a mod-9 property (with a special-case for 0), enabling an O(1) solution without loops or recursion.