update

Author: zdevt

README.md

@@ -1 +1,4 @@
-# python_learning
+# python_learning
+
+# python 启用当前文件夹http共享   打开  http://ip:8000 可以打开文件夹
+python -m SimpleHTTPServer

leetcode/479.py

@@ -0,0 +1,56 @@
+#!/usr/bin/env python
+#-*- coding:utf-8 -*-
+#       FileName:  479.py
+#
+#    Description:
+#
+#        Version:  1.0
+#        Created:  2018-07-18 09:34:57
+#  Last Modified:  2018-07-19 09:00:08
+#       Revision:  none
+#       Compiler:  gcc
+#
+#         Author:  zt ()
+#   Organization:
+
+
+def CheckPalindrome(v):
+    if v < 10:
+        return True
+
+    if v % 10 == 0:
+        return False
+
+    back = 0
+    while v > back:
+        back = back * 10 + v % 10
+        v = v // 10
+
+    return (v == back) or (back // 10 == v)
+
+
+def largestPalindrome(n):
+    n = n - 1
+    temp = 0
+    k = (n + 1) // 2
+    for i in range((10**k - 1) * 10**(n - k + 1), 10**(n + 1)):
+        for j in range((10**k - 1) * 10**(n - k + 1), 10**(n + 1)):
+            if CheckPalindrome(i * j):
+                temp = max(temp, i * j)
+                print(i, j, i * j, temp)
+
+    print(temp % 1337)
+    return temp % 1337
+
+
+def largestPalindrome2(n):
+    temp = 0
+    for i in range(10**(2 * n - 1), 10**(2 * n - 2),-1):
+        if CheckPalindrome(i):
+            temp = i
+    print(temp)
+    return temp % 1337
+
+
+# largestPalindrome(7)
+largestPalindrome2(4)

leetcode/650.py

@@ -6,31 +6,44 @@
 #
 #        Version:  1.0
 #        Created:  2018-07-17 14:19:30
-#  Last Modified:  2018-07-18 08:50:57
+#  Last Modified:  2018-07-18 11:38:14
 #       Revision:  none
 #       Compiler:  gcc
 #
 #         Author:  zt ()
 #   Organization:
 
 
+def MinSteps2(n):
+    i = 2
+    temp = 0
+    while i <= n:
+        if n % i == 0:
+            temp += i
+            n = n / i
+        else:
+            i += 1
+    return temp
+
+
 def MinSteps(n):
     if n == 1:
         return 0
 
     if 2 <= n <= 3:
         return n
 
-    (x,y)=(1,n)
+    (x, y) = (1, n)
     for i in range(2, n // 2):
         v = n / i
         if v.is_integer():
-            (x,y)=(i,int(v))
+            (x, y) = (i, int(v))
             break
 
     if x == 1:
         return y
 
     return MinSteps(x) + MinSteps(y)
 
-print(MinSteps(188))
+
+print(MinSteps2(18))