Challenge287 | Python Fiddle

# [2016-10-10] Challenge #287 [Easy] Kaprekar's Routine

def largest_digit (nums):
    arr = []
    numsToString = str(nums)
    large_num = 0
    
    # check if there is 4 digits; otherwise, add 0 to beginning
    if len(numsToString) < 4:
        arr.append(0)
    
    for i in numsToString:
        arr.append(int(i))
    
    for j in arr:
        if j > large_num:
            large_num = j
    
    return large_num

print largest_digit(1234)
print largest_digit(3253)
print largest_digit(9800)
print largest_digit(3333)
print largest_digit(120)

print "\n"

# bonus 1

def decen_order (nums):
    arr = []
    numsToString = str(nums)
    
    if len(numsToString) < 4:
        arr.append(0)
        
    for i in numsToString:
    	arr.append(int(i))
     
    arr.sort()
    arr.reverse()
    
    return arr

print decen_order(1234)
print decen_order(3253)
print decen_order(9800)
print decen_order(3333)
print decen_order(120)

print "\n"

# bonus 2

def kaprekar (nums):
    temp = []
    arr = []
    numsToString = str(nums)
    
    for i in numsToString:
        temp.append(int(i))
        arr.append(int(i))
        
    arr.sort()
    
    num1 = arr.join('')
    
    return num1

print kaprekar(6589)
print kaprekar(5455)
print kaprekar(6174)

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE