>>> def f(*args):
	print args
>>> f(1)
(1,)
>>> f(1,2,3)
(1, 2, 3)
>>> f()
()
>>> f(1,2)
(1, 2)

2.传递字典参数

>>> def f1(**args):
	print args

>>> f1(a=1,b=2)
{'a': 1, 'b': 2}

#coding=utf-8               #用来支持中文，=号前后不能有空格
#minmax.py
def minmax(test,*args):
    res=args[0]
    for arg in args[1:]:    #循环args中内容副本
        if test(arg,res):
            res=arg
    return res

def lessthan(x,y):return x<y
def grtrthan(x,y):return x>y

print minmax(lessthan,4,7,9,22,2,18)
print minmax(grtrthan,4,7,9,22,2,18)

>>> def f2(a,*pargs,**kargs):
	print a,pargs,kargs

>>> f2(1,2,3,4,5,x=11,y=12)
1 (2, 3, 4, 5) {'y': 12, 'x': 11}

>>> def intersct(*args):
	res=[]
	for x in args[0]:
		for other in args[1:]:
			if x not in other:break
			else:res.append(x)
	return res

>>> def union(*args):
	res=[]
	for seq in args:
		for x in seq:
			if not x in res:
				res.append(x)
	return res

>>> s1,s2,s3="SPAM","SCAM","SLAM"
>>> intersct(s1,s2)
['S', 'A', 'M']
>>> union(s1,s2)
['S', 'P', 'A', 'M', 'C']

>>> class C:
	    X = 33
	    def m(self):
		    X = 44
		    self.X = 55
>>> obj = C()
>>> print obj.X
33
>>> obj.m()
>>> print obj.X
55
>>> C.X
33

>>> def classtree(cls,indent):
	print '.'*indent,cls.__name__
	for supercls in cls.__bases__:
		classtree(supercls,indent+3)

	
>>> def instancetree(inst):
	print 'Tree of ',inst
	classtree(inst.__class__,3)

	
>>> def selftest():
	class A:pass
	class B(A):pass
	class C(A):pass
	class D(B,C):pass
	class E:pass
	class F(D,E):pass
	instancetree(B())
	instancetree(F())

	
>>> selftest()
Tree of  <__main__.B instance at 0x012E1A08>
... B
...... A
Tree of  <__main__.F instance at 0x012E1A08>
... F
...... D
......... B
............ A
......... C
............ A
...... E