class Solution:
def convert(self, s, numRows):
ss = ""
n = len(s)
if numRows==1:
return s
if numRows == 2:
s_s = ''
s_ss = ''
for i in range(0,n):
if i%2==0:
s_s+=s[i]
else:
s_ss+=s[i]
return s_s+s_ss
y = 2*numRows - 2
for i in range(numRows):
y_a = 2*i
y_b = y - y_a
if y_a==0 or y_b==0:
for j in range(0,n,y):
if i+j<n:
ss += s[i+j]
else:
for j in range(0,n+y,y):
if (i+j)-y_a<n and j !=0:
ss += s[(i+j)-y_a]
if (i+j)<n:
ss += s[i+j]
return ss
class Solution:
def myAtoi(self, s):
digit_list = ['1','2','3','4','5','6','7','8','9','0']#,'-','+']
s = s.split()
if len(s)==0:
return 0
if len(s)==1 and (s[0]=='+' or s[0]=='-'):
return 0
s = s[0]
if len(s)==0:
return 0
if len(s)==1 and (s[0]=='+' or s[0]=='-'):
return 0
count = 0
D = ''
if s[0] not in digit_list:
if (s[0]=='-' or s[0]=='+') and (s[1] in digit_list):
D += s[0]
count += 1
else:
return 0
for j in range(count,len(s)):
if s[j] not in digit_list:
break
D+=s[j]
D = int(D)
if D>2147483647:
return 2147483647
if D<-2147483648:
return -2147483648
return D
It's not difficult to discuss by category.
