vfp编程 哪个高手救救我啊

store '12345' to c,cc
max=left(c,1)
min=left(c,1)
p=space(0)
do while len(c)>0
s=left(c,1)
if s>max
max=s
endif
if s<min
min=s
endif
p=left(c,1)+p
c=substr(c,2)
enddo
?cc+"的反序为",p
?"最小为:",min
?"最大为 :",max

希望对你有所帮助：
set talk off
clear
m = '123456'
x = ''
a = len(m)
minimum = left(m,1)
maximum = left(m,1)
for n = a to 1 step -1
t = subs (m,n,1)
if val(minimum) > val(t)
minimum = t
endif
if val(maximum) < val(t)
maximum = t
endif
x = x + upper(t)
endfor
? "颠倒后的字符串为：" + x
? 'max = ' + maximum
? 'min = ' + minimum
set talk on
return