c++程序员学python3.1.2
FanTasyCC
这个作者很懒,什么都没留下…
展开
-
python算法实践1-直接插入排序
# 直接插入排序def InsertSort(mylist): size = len(mylist) i = 1 for i in range(1, size): if mylist[i] < mylist[i - 1]: tmp = mylist[i] j = i - 1原创 2010-03-16 10:22:00 · 1823 阅读 · 0 评论 -
Python SMTP协议发送QQ邮件
from email.header import Headerfrom email.mime.text import MIMETextfrom email.mime.multipart import MIMEMultipartimport smtplib, datetimemsg = MIMEMultipart()att = MIMEText(open('d:\\m原创 2012-06-07 20:24:16 · 5846 阅读 · 1 评论 -
Python编写FTP下载程序
import ftplibimport osimport socketimport sysHOST = '127.0.0.1'DIRN = 'd:\\G'FILE = 'xue.jpg'USER_NAME = 'liyong'PWD = '123456'def DownloadFile(file_name): try: f =原创 2012-06-07 20:22:28 · 5275 阅读 · 0 评论 -
python编码规范(部分)
查询结果[1]: pay.jxworld.com.my ==>> 113.23.142.49 ==>> 1897369137 ==>> 马来西亚 5b585240551348545a554c5d57Python代码规范(针对3.1.2版本)1.以4个空格作为缩进层次2.不要混用制表符和空格作为缩进层次3.每一行代码字符数不要超过79,否则积极使用行连接符'/'4.使用UTF-8编码关于importYes: import os import sysNo: import原创 2010-09-30 09:27:00 · 860 阅读 · 0 评论 -
python删除恼人的.svn
<br />#!/usr/bin/env pythonimport os;import shutil;import stat;import sys;def DelSubFile(svnPath): for item in os.listdir(svnPath): fp = os.path.join(svnPath, item); if os.path.isfile(fp): os.chmod(fp, stat.S_I原创 2010-08-30 12:55:00 · 1099 阅读 · 0 评论 -
python线程
import threadingimport timeimport random#生产者class Producer(threading.Thread): def __init__(self, threadName, shareObject): threading.Thread.__init__(self, name = threadName)原创 2010-03-26 16:11:00 · 925 阅读 · 0 评论 -
python学习1-使用类
#使用类class CPerson: #类变量好比C++中的静态成员变量 population = 0 def SayHi(self): print(Hello World) def HowMany(self): if CPerson.population == 1: prin原创 2010-03-18 11:32:00 · 1028 阅读 · 0 评论 -
python学习3-使用dict
#构造d = dict(one = 33, two = 44)print(d)d0 = dict({one : 55, two : 66})print(d0)d1 = dict(zip((one, two), (77, 88)))print(d1)d2 = dict([(one, 3), (two, 4)])print(d2)d3 = {原创 2010-03-20 15:23:00 · 2372 阅读 · 0 评论 -
python学习2-使用list
# 0 1 2 3 4 5 6# -7 -6 -5 -4 -3 -2 -1a = [1, 2, 3, 4, 5, 6, 7]#子list提取#起始位置:结束位置(不包括结束位置的元素)b = a[1:4]print(b)#默认是最后一个元素的下一位(好比C++的迭代器)c = a[1:]print(c)d = a[1:-1]prin原创 2010-03-19 10:04:00 · 709 阅读 · 0 评论 -
python算法实践6-堆排序
#堆排序def Heapify(mylist, start, end): left = 0 right = 0 maxv = 0 left = start * 2 right = start * 2 + 1 while left <= end: maxv = left if right <= end原创 2010-03-16 16:21:00 · 1823 阅读 · 0 评论 -
python算法实践4-快速排序
#快速排序def Partition(mylist, low, high): tmp = mylist[low] while low < high: while low = tmp: high = high - 1 if low < high: mylist[low] = mylist[原创 2010-03-16 15:03:00 · 1881 阅读 · 0 评论 -
python算法实践7-归并排序
def MergeSort(mylist, low, mid, high): i = low j = mid + 1 tmp = [] while i <= mid and j <= high: if mylist[i] <= mylist[j]: tmp.append(mylist[i])原创 2010-03-16 17:09:00 · 1161 阅读 · 2 评论 -
python算法实践5-直接选择排序
#直接选择排序def SelectSort(mylist): size = len(mylist) i = 0 for i in range(0, size): k = i for j in range(i + 1, size): if mylist[j] < mylist[k]:原创 2010-03-16 15:24:00 · 1127 阅读 · 0 评论 -
python算法实践3-冒泡排序
#冒泡排序def BubbleSort(mylist): n = len(mylist) i = 0 j = 0 bExchange = False for i in range(1, n): bExchange = False j = n - 1 while j >= i:原创 2010-03-16 14:08:00 · 1577 阅读 · 0 评论 -
python算法实践2-shell排序
#shell排序def ShellPass(mylist, d): size = len(mylist) i = d while i < size: if mylist[i] < mylist[i - d]: tmp = mylist[i] j = i - d myli原创 2010-03-16 11:45:00 · 867 阅读 · 0 评论 -
在Windows上通过ctypes遍历进程
import ctypesimport sysTH32CS_SNAPPROCESS = 0x00000002class PROCESSENTRY32(ctypes.Structure): _fields_ = [("dwSize", ctypes.c_ulong), ("cntUsage", ctypes.c_ulong),原创 2012-06-16 20:13:21 · 3057 阅读 · 0 评论