![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
python学习
YatKam
成长在于积累,分享是种美德!
展开
-
安装python2.7
原文地址:安装python2.7作者:悦linuxwget http://python.org/ftp/python/2.7.2/Python-2.7.2.tgztar zxvf Python-2.7.2.tgzcd Python-2.7.2./configure --with-threads --enable-sharedmakemake installmv /usr/bin/py转载 2015-04-28 15:32:24 · 566 阅读 · 0 评论 -
python urlparse详解
原文地址:urlparse详解">python urlparse详解作者:悦linux对搜索引擎、文件索引、文档转换、数据检索、站点备份或迁移等应用程序来说,经常用到对网页(即HTML文件)的解析处理。事实上,通过Python语言提供的各种模块,我们无需借助Web服务器或者Web浏览器就能够解析和处理HTML文档。本文将详细介绍如何利用Python抓取和解析网页。首先,我们介绍一个可以帮助转载 2015-04-28 15:32:30 · 1119 阅读 · 0 评论 -
python OS模块
原文地址:OS模块">python OS模块作者:悦linux下面列出了一些在Python os模块中比较有用的部分。它们中的大多数都简单明了。os.sep 可以取代操作系统特定的路径分割符。os.name字符串指示你正在使用的平台。比如对于Windows,它是'nt',而对于Linux/Unix用户,它是'posix'。os.getcwd()函数得到当前工作目录,即当前Python脚本工转载 2015-04-28 15:32:27 · 540 阅读 · 0 评论 -
LeetCode解题报告--Next Permutation
题目: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest pos原创 2015-12-03 20:54:30 · 1838 阅读 · 1 评论 -
LeetCode解题报告-- Count and Say
题目: The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, … 1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read原创 2015-12-03 15:05:12 · 2613 阅读 · 1 评论 -
LeetCode解题报告--Search for a Range
题目: Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). If the target is not f原创 2015-12-04 13:32:03 · 2410 阅读 · 0 评论 -
LeetCode解题报告--Search Insert Position
题目: Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the a原创 2015-12-04 16:58:11 · 1806 阅读 · 0 评论 -
LeetCode解题报告--Combination Sum
题目: Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimited n原创 2015-12-07 20:24:31 · 1069 阅读 · 1 评论 -
LeetCode解题报告--Combination Sum II
题目: Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be used once in the comb原创 2015-12-07 21:10:15 · 1173 阅读 · 0 评论