2015.8.24-LeetCode

The code for two LeetCode problems

First one: Add Digits

# Language: Python
# Owner: Touma
# Initial Edition: Need improvement!!!
# Description:
# Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
# For example:
# Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one
# digit, return it.
# Follow up:
# Could you do it without any loop/recursion in O(1) runtime?
class Solution(object):
    def addDigits(self, num):
        """
        :type num: int
        :rtype: int
        """
        cnt = 0
        while (len(str(num)) != 1):
            memo = list(str(num)) # spilt the number into single digit
            for s in memo:
                cnt = cnt + int(s) # Add the 
            num = cnt
            cnt = 0
        return num # return the result

This is the initial edition of the Problem, the code can be improved!

Second: Single Number

# Language: Python
# Owner: Touma
# Initial Edition
# Description:Given an array of integers, every element appears twice except for one. Find that single one.
# Note:
# Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

class Solution(object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n1 = 0
        for integer in nums:
            n1 ^= integer
        return n1

In this problem, the hint for solving the problem is to understand the usage of the ‘^=’. The next paragraph will discuss the function of this operator.

For example, a ^= b is equals to a = a ^ b. Initially, the n1 is set to be 0.