Solution to Project Euler #4

projecteuler4.py

def isPalindrome(number):
    string = str(number)
    list = []
    revList = []

    i = 0;
    while i<len(string):
        list.append(string[i])
        i += 1

    i = len(string)-1

    while i>=0:
        revList.append(string[i])
        i -= 1

    i = 0
    x = ''
    while i<len(list):
        x += str(list[i])
        i += 1

    i = 0
    y = ''
    while i < len(list):
        y += str(revList[i])
        i += 1

    return x==y

# Working method
def run():
    i, j, count, index = 100,100, 0, 0

    palin = []

    while i<1000:
        while j<1000:
            print(str(i) + ', ' + str(j) + ': ' + str(i*j))
            if(isPalindrome(i*j)):
                palin.append(i*j)
                index += 1
            count += 1
            j += 1
        i += 1
        j=100

    biggest = 0
    for i in palin:
        if(i>biggest):
            biggest = i

    print(biggest)
    print(len(palin))

run()

# Not working
# def run():
#     i, j, count, index = 999,999, 0, 0
#
#     palin = []
#
#     while i>100:
#         while j>100:
#             print(str(i) + ', ' + str(j) + ': ' + str(i*j))
#             if(isPalindrome(i*j)):
#                 return(i*j)
#             count += 1
#             j -= 1
#         i -= 1
#         j=999
#
#     biggest = 0
#     for i in palin:
#         if(i>biggest):
#             biggest = i
#
#     print(biggest)
#     print(len(palin))
#
#     return 'Nothing'
#
# print(run())