t r'not found'
算法简单,而且是O(n)的,12行代码搞定。参考http://blog.renren.com/share/235087438/3004327956
35.支配点问题:
支配数:数组中某个元素出现的次数大于数组总数的一半时就成为支配数,其所在位序成为支配点;比如int[] a = {3,3,1,2,3};3为支配数,0,1,4分别为支配点;
要求:返回任何一个支配点
1 li = [3,3,1,2,3]
2 def main():
3 mid = len(li)/2
4 for l in li:
5 count = 0
6 i = 0
7 mark = 0
8 while True:
9 if l == li[i]:
10 count += 1
11 temp = i
12 i += 1
13 if count > mid:
14 mark = temp
15 return (mark,li[mark])
16 if i > len(li) - 1:
17 break
18
19 if __name__ == "__main__":
20 print main()
36.什么是PEP 8
参考:http://www.python.org/dev/peps/pep-0008/
37.Python2.x和Python3.x的区别
从Python2到Python3,很多基本的函数接口变了,甚至是,有些库或函数被去掉了,改名了。
参考:http://www.cnblogs.com/codingmylife/archive/2010/06/06/1752807.html
转载自 http://www.cnblogs.com/goodhacker/p/3366618.html
辅导python
一元问python