python
zl87758539
C++/PYTHON/ASR
展开
-
[leetcode] 19. Remove Nth Node From End of List python实现【easy】
Remove Nth Node From End of List My Submissions QuestionEditorial Solution Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1原创 2016-06-14 21:50:21 · 1530 阅读 · 0 评论 -
PYTHON 词图/WordCloud,
需要两个库一个是jieba切词库,将一段句子切词用法比较简单。就是import jiebaprint " ".join(jieba.cut('我是来自中国北京清华大学的一名硕士研究生,这是我的测试语句,下面测试北京大学生和北京大学学生。'))#默认精准模式词云代码。py实现from os import pathimport jiebaimport matplotlib.pyplot as p原创 2017-06-23 00:47:19 · 1094 阅读 · 0 评论 -
python 合并 累加两个dict
比如说有两个dict:x和y1.比较快的自己写的,def merge_dict(x,y): for k,v in x.items(): if k in y.keys(): buffer[k] += v else: buffer[k] = v2.调用a原创 2017-01-22 14:33:28 · 6826 阅读 · 0 评论 -
用Python发邮件,QQ邮件,解决(Error: A secure connection is requiered(such as ssl))
用Python发邮件,QQ邮件 之前查的网上的代码 都有 503 ‘Error: A secure connection is requiered(such as ssl)’之类的Bug. QQ邮箱要求ssl,smtp.qq.com 端口号465. 因此我们把smtplib.SMTP()改成smtplib.SMTP_SSL()#-*-coding:utf-8-*- #==========原创 2016-11-27 12:31:17 · 7704 阅读 · 2 评论 -
[leetcode]45. Jump Game II 跳棋游戏2 C++/PYTHON实现【hard难度】
题目 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your go原创 2016-06-17 10:15:08 · 2065 阅读 · 0 评论 -
[leetcode]55. Jump Game ,C++/PYTHON实现,medium难度
[leetcode]55. Jump Game ,C++/PYTHON实现,medium难度原创 2016-06-16 21:50:40 · 1492 阅读 · 0 评论 -
[leetcode]41. First Missing Positive,C++/python实现,hard难度
[leetcode]41. First Missing Positive,C++/python实现,hard难度原创 2016-06-16 19:37:56 · 893 阅读 · 0 评论 -
[leetcode]40. Combination Sum II ,python实现【medium难度】
Combination sum 2.python实现原创 2016-06-16 17:37:04 · 2016 阅读 · 0 评论 -
[leetcode]39. Combination Sum,python实现【Medium难度】
39.COMBINATION SUM,PYTHON实现原创 2016-06-16 17:01:20 · 5355 阅读 · 0 评论 -
【leetcode】 46. Permutations ,python实现
Permutations Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,原创 2016-06-15 15:43:54 · 5786 阅读 · 0 评论 -
[leetcode]47. Permutations II,python实现
题目: Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [ [1,1,2],原创 2016-06-16 16:24:48 · 2084 阅读 · 0 评论 -
[leetcode]53. Maximum Subarray 最大连续子串python实现【medium】
题目: Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the cont原创 2016-06-15 00:30:28 · 5763 阅读 · 1 评论 -
【转载】python获取文件及文件夹大小
使用os.path.getsize函数,参数是文件的路径。获取文件夹大小,即遍历文件夹,将所有文件大小加和。遍历文件夹使用os.walk函数import osfrom os.path import join, getsizedef getdirsize(dir): size = 0L for root, dirs, files in os.walk(dir): size转载 2016-06-13 10:10:20 · 2210 阅读 · 0 评论 -
Python if 和 for 的多种写法
a, b, c = 1, 2, 3【对比Cpp里:c = a >b? a:b】这个写法,python只能常规的空行,缩进吗?人生苦短,我用python,下面介绍几种if的方便的方法。1.常规if a>b: c = aelse: c = b2.表达式c = a if a>b else b原创 2016-06-15 00:05:55 · 55178 阅读 · 0 评论 -
[leetcode]20. Valid Parentheses ,有效的括号符串python实现【easy】
题目: Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and “()[]{}” are all原创 2016-06-14 22:58:30 · 885 阅读 · 0 评论 -
[leetcode] 17. Letter Combinations of a Phone Number ,python实现【medium】
Letter Combinations of a Phone Number Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the teleph原创 2016-06-14 22:25:54 · 2260 阅读 · 0 评论 -
ubuntu 安装anaconda不能正常使用pip的问题,以及conda install error 和 Error: Missing write permissions in:的问题
ubuntu直接安装anaconda是不能直接使用pip 的,因为pip install需要sudo权限,而sudo pip是系统自带的python的pip 这两个是不一样的。 之前还试过在~/anaconda2/lib/python2.7/site-packages 里面加sudo python 的.pth文件 但是指标不治本。 因此决定zhoulu@zhoulu-MS-7A70:~$ su原创 2017-06-27 20:57:13 · 10384 阅读 · 5 评论