[leetcode]初级算法——数学

Fizz Buzz

Write a program that outputs the string representation of numbers from 1 to n.

But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.

Example:

n = 15,

Return:
[
    "1",
    "2",
    "Fizz",
    "4",
    "Buzz",
    "Fizz",
    "7",
    "8",
    "Fizz",
    "Buzz",
    "11",
    "Fizz",
    "13",
    "14",
    "FizzBuzz"
]

Code(By myself):

class Solution(object):
    def fizzBuzz(self, n):
        """
        :type n: int
        :rtype: List[str]
        """
        rlist = []
        for i in range(1,n+1):
            if i % 15 == 0:
                rlist.append('FizzBuzz')
            elif i % 3 == 0:
                rlist.append('Fizz')
            elif i % 5 == 0:
                rlist.append('Buzz')
            else:
                rlist.append(str(i))
        return rlist

计数质数

Count the number of prime numbers less than a non-negative number, n.

Example:

Input: 10
Output: 4
Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7.

Code(By myself):

class Solution(object):
    def countPrimes(self, n):
        """
        :type n: int
        :rtype: int
        """
        flag = [True for i in range(1,n+1)]
        count = 0
        for i in range(2,n):
            if flag[i]:
                count += 1
                j = 1
                while j * i < n:
                    flag[j*i] = False
                    j += 1
        return count

Code(others):

class Solution(object):
    def countPrimes(self, n):
        """
        :type n: int
        :rtype: int
        """
        if n<=2:
            return 0
        primes = [True]*(n/2)
        for i in range(3,int(n**0.5)+1,2):
            if primes[i//2]:
                primes[i*i//2::i]=[False]*(len(primes[i*i//2::i]))
        return sum(primes)

总结:

不断过滤掉循环范围

3的幂

Given an integer, write a function to determine if it is a power of three.

Example:

Input: 27
Output: true

Code(By myself):

class Solution(object):
    def isPowerOfThree(self, n):
        """
        :type n: int
        :rtype: bool
        """
        # if n == 1:
        #     return True
        # if n % 3 != 0 or n == 0:
        #     return False
        # return self.isPowerOfThree(n/3)
        if n > 0:
            if 3 ** round(math.log(n,3)) == n:
                return True
            else:
                return False
        else:
            return False

Code(others):

class Solution(object):
    def isPowerOfThree(self, n):
        """
        :type n: int
        :rtype: bool
        """
        return n > 0 and 1162261467 % n == 0

罗马数字转整数

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

• I can be placed before V (5) and X (10) to make 4 and 9. 
• X can be placed before L (50) and C (100) to make 40 and 90. 
• C can be placed before D (500) and M (1000) to make 400 and 900.

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

Example:

Input: "III"
Output: 3

Code(By myself):

class Solution(object):
    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """
        length = len(s)
        dic = {
            'I' : 1,
            'V' : 5,
            'X' : 10,
            'L' : 50,
            'C' : 100,
            'D' : 500,
            'M' : 1000
        }
        number = 0
        flag = float('inf')
        for i in s:
            if dic[i] <= flag:
                number += dic[i]
                flag = dic[i]
            else:
                number = number - 2 * flag + dic[i]
                flag = dic[i]
        return number 

Code(others):

class Solution(object):
    roman_map = {
        'I': 1, 'II': 2, 'III': 3, 'IV': 4, 'V': 5, 'VI': 6, 'VII': 7, 'VIII': 8, 'IX': 9,
        'X': 10, 'XX': 20, 'XXX': 30, 'XL': 40, 'L': 50, 'LX': 60, 'LXX': 70, 'LXXX': 80, 'XC': 90,
        'C': 100, 'CC': 200, 'CCC': 300, 'CD': 400, 'D': 500, 'DC': 600, 'DCC': 700, 'DCCC': 800, 'CM': 900,
        'M': 1000, 'MM': 2000, 'MMM': 3000
    }

    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """

        unit = ''
        unit_sum = 0
        total = 0
        for letter in s:
            unit += letter
            if self.roman_map.has_key(unit):
                unit_sum = self.roman_map[unit]
            else:
                unit = letter
                total += unit_sum
                unit_sum = self.roman_map[unit]

        return total + unit_sum