Python编程
文章平均质量分 54
u010105243
这个作者很懒,什么都没留下…
展开
-
python实现模糊匹配
题目:模糊匹配, ‘?’代表一个字符, *代表任意多个字符。给一段明确字符比如avdjnd 以及模糊字符比如*dj?dji?ejj,判断二者是否匹配。若能匹配输出”Yes”, 否则输出“No”(为了方便阅读,代码里面输出Ture or False)解题的思路:通过明确终止条件通过递归的方式求解终止的条件:(1) Str为空 以及 pattern为空或者pattern元素只有[*], 输出T...原创 2018-10-17 22:39:30 · 41216 阅读 · 4 评论 -
20170708-leetcode-258-Add Digits
1.DescriptionGiven a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only原创 2017-07-08 21:45:52 · 277 阅读 · 0 评论 -
20170613-leetcode-535-Encode and Decode TinyURL
1.Description Note: This is a companion problem to the System Design problem: Design TinyURL.TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-ti原创 2017-06-13 10:36:33 · 928 阅读 · 0 评论 -
20170611-leetcode-041-First Missing Positive
1.DescriptionGiven an unsorted integer array, find the first missing positive integer.For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses co原创 2017-06-12 11:25:03 · 300 阅读 · 0 评论 -
20170612-leetcode-575-Distribute Candies
Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute these原创 2017-06-12 10:32:53 · 748 阅读 · 0 评论 -
20170603-leetcode-560-Subarray Sum Equals K
1.DescriptionGiven an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.Example 1:Input:nums = [1,1,1], k = 2 Output: 2Note:The length原创 2017-06-03 16:16:06 · 338 阅读 · 0 评论 -
20170607-leetcode-189-Rotate Array
1.DescriptionRotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note: Try to come up as many solutions as原创 2017-06-07 15:41:22 · 287 阅读 · 0 评论 -
20170602-leetcode-211-Add and Search Word - Data structure design
1.DescriptionDesign a data structure that supports the following two operations:void addWord(word) bool search(word)search(word) can search a literal word or a regular expression string containing onl原创 2017-06-02 22:32:30 · 378 阅读 · 0 评论 -
20170606-leetcode-581-Shortest Unsorted Continuous Subarray
1.DescriptionGiven an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You nee原创 2017-06-06 11:24:09 · 560 阅读 · 0 评论 -
20170605-leetcode-532-K-diff Pairs in an Array
1.DescriptionGiven an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are bot原创 2017-06-05 23:17:30 · 482 阅读 · 0 评论 -
Python 中glob模块使用笔记
1.介绍glob模块用来查找文件目录和文件,常见的两个方法有glob.glob()和glob.iglob(),可以和常用的find功能进行类比,glob支持*?[]这三种通配符2.三种通配符*代表0个或多个字符?代表一个字符[]匹配指定范围内的字符,如[0-9]匹配数字3.例子import globfilelist=glob.glob(r'./*.py')#返回的数据类型是list,#原创 2017-08-08 14:51:29 · 14976 阅读 · 0 评论 -
Tensorflow学习笔记(2)-基本运算
# -*- coding: utf-8 -*-# @Time : 17-8-1 下午8:02# @Author : 未来战士biubiu!!# @FileName: 2-basic operation.py# @Software: PyCharm Community Edition# @Blog :http://blog.csdn.net/u010105243/article原创 2017-08-01 20:20:16 · 480 阅读 · 0 评论 -
Tensorflow学习笔记(1)-Helloworld
# -*- coding: utf-8 -*-# @Time : 17-8-1 下午7:58# @Author : 未来战士biubiu!!# @FileName: 1-tensorflow.py# @Software: PyCharm Community Edition# @Blog :http://blog.csdn.net/u010105243/article/impo原创 2017-08-01 19:59:25 · 395 阅读 · 0 评论 -
【Python代码】给定正整数,在+-*/的情况下,算法实现24点游戏,计算所有的可能
下面回顾一下前两天面试过程中,做的一到笔试题:题目:计算24 点,输入4 个整数,如何计算得到24,输出所有可能的计算方式; 若不能计算得到则输出None。解题思路:由于不考虑顺序, 括号的位置可以认为有两种[(a, b, c)d ] [(a,b),(c,d)],然后递归地遍历所有的情况。里面有两个小点:(1) a+b和b+a的情况一样,可以去掉一部分的计算(2) 主函数中考虑到浮点计算,...原创 2018-10-17 22:25:12 · 1459 阅读 · 0 评论 -
对图片进行批处理剪切成需要的大小
“`python import argparse import os from PIL import Imagedef resize_image(image, size): “”“Resize an image to the given size.”“” return image.resize(size, Image.ANTIALIAS)def resize_images(原创 2017-11-16 21:40:02 · 1497 阅读 · 1 评论 -
使用jieba分词对中文文档进行分词|停用词去重
# -*- encoding:utf-8 -*-import osimport jieba#加载停用词词典stopwordsfile = open('E:/Workspace/Python/ExamTxT/stopword.txt','r+')# 加载个人词典jieba.load_userdict('E:/Workspace/Python/ExamTxT/userdict.txt')原创 2016-11-27 11:02:53 · 34099 阅读 · 6 评论 -
Python 使用matplotlib使用并自定义colormap
0.前言添加colormap的对象是灰度图,可以变成热量图,从而更加明显的发现一些规律,适用于一些雷达图像等from PIL import Image# 将彩色图片转换成黑白图片im=Image.open("./pic.jpg").convert('L')# 保存图片im.save("image.jpg")1.从灰色图片中读取数据,转换成colormap图import matplotlib.原创 2017-08-07 19:55:18 · 39289 阅读 · 1 评论 -
Tensorflow学习笔记(5)-网络结构的构建
# -*- coding: utf-8 -*-# @Time : 17-8-4 上午10:57# @Author : 未来战士biubiu!!# @FileName: 5-buildstructure.py# @Software: PyCharm Community Edition# @Blog :http://blog.csdn.net/u010105243/article原创 2017-08-04 14:31:23 · 460 阅读 · 0 评论 -
在Pycharm中自动添加时间日期作者等信息
1.按照下面路径以此打开File→\toSettings→\toEditor→\toFile and code Templates 右侧找到Python Script,如下图 2.设置相关代码如下##!/usr/bin/python3# -*- coding: utf-8 -*-# @Time : ${DATE} ${TIME}# @Author : 未来战士biubiu!!#原创 2017-07-26 17:26:38 · 20626 阅读 · 4 评论 -
Tensorflow学习笔记(4)-mnist(MultilayerConvolutionalNetwork)
# -*- coding: utf-8 -*-# @Time : 17-8-1 下午9:40# @Author : 未来战士biubiu!!# @FileName: 4-mnist(MultilayerConvolutionalNetwork).py# @Software: PyCharm Community Edition# @Blog :http://blog.csdn.原创 2017-08-01 23:04:15 · 622 阅读 · 0 评论 -
Tensorflow学习笔记(3)-mnist(softmax regression)
# -*- coding: utf-8 -*-# @Time : 17-8-1 下午8:22# @Author : 未来战士biubiu!!# @FileName: 3-nearest neighbor.py# @Software: PyCharm Community Edition# @Blog :http://blog.csdn.net/u010105243/articl原创 2017-08-01 21:32:13 · 309 阅读 · 0 评论 -
20170615-leetcode-409. Longest Palindrome
1.DescriptionGiven a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.This is case sensitive, for example "Aa" is原创 2017-06-15 23:34:04 · 215 阅读 · 0 评论 -
201705031-leetcode-155-Min Stack
1.DescriptionDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top原创 2017-05-31 15:30:57 · 280 阅读 · 0 评论 -
20170328-leetcode-452-Minimum Number of Arrows to Burst Balloons
1.DescriptionThere are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizonta原创 2017-03-28 11:14:52 · 328 阅读 · 0 评论 -
20170311-leetcode-Fractial Trailing Zeroes
1.Fractorial Trailing ZeroesGiven an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. https://leetcode.com/problems/factorial-trail原创 2017-03-11 11:58:29 · 306 阅读 · 0 评论 -
20170320-leetcode-401-Binary Watch
2017-03-20 20:51:00 星期一1.Descriptionhttps://leetcode.com/problems/binary-watch/#/description A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represe原创 2017-03-20 23:00:57 · 314 阅读 · 0 评论 -
20170307-leetcode-263-Ugly Number
1.DescriptionWrite a program to check whether a given number is an ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugl原创 2017-03-07 11:17:23 · 291 阅读 · 0 评论 -
20170306-leetcode-202-Happy Number
1.DescriptionWrite an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the原创 2017-03-06 22:17:41 · 324 阅读 · 0 评论 -
20170308-leetcode-445-Add Two Numbers
1.DescriptionYou are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers原创 2017-03-08 23:44:31 · 388 阅读 · 0 评论 -
20170225-leetcode-151-Reverse Words in a String
1.DescriptionGiven an input string, reverse the string word by word.For example, Given s = “the sky is blue”, return “blue is sky the”.Update (2015-02-12): For C programmers: Try to solve it in-plac原创 2017-02-25 20:57:34 · 254 阅读 · 0 评论 -
20170223-LeetCode_434_Number of Segments in a String
1.DescriptionCount the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.Please note that the string does not contain any non-printable char原创 2017-02-23 09:49:11 · 284 阅读 · 0 评论 -
20170301-leetcode-215-Kth Largest Element in an Array
1.DescriptionFind the **k**th largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example, Given [3,2,1,5,6,4] and k =原创 2017-03-01 23:17:35 · 281 阅读 · 0 评论 -
20170321-leetcode-131-Palindrome partitioning
1.DescriptionGiven a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = "aab", Return[ ["aa","b原创 2017-03-21 18:14:37 · 294 阅读 · 0 评论 -
20170314-leetcode-278-First Bad Version
1.DescriptionYou are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed原创 2017-03-14 10:51:13 · 256 阅读 · 0 评论 -
20170323-leetcode-089-Gray Code
1.DescriptionThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequ原创 2017-03-23 23:04:49 · 271 阅读 · 0 评论 -
Python 正则表达
1.match和search的区别def re_method():# search vs. Matchs = 'abcd'print(re.search(r'c', s))print(re.match(r'c', s))if __name__ == '__main__':re_method()返回值为 <_sre.SRE_Match object; span=(2, 3), match原创 2017-05-30 20:36:31 · 566 阅读 · 0 评论 -
20170630-leetcode-225 Implement Stack using Queues
1.DescriptionImplement the following operations of a stack using queues. - push(x) – Push element x onto stack. - pop() – Removes the element on top of the stack. - top() – Get the top element. - e原创 2017-05-30 10:21:12 · 373 阅读 · 0 评论 -
20170529-leetcode-582-Kill process
1.DescriptionGiven n processes, each process has a unique PID (process id) and its PPID (parent process id). Each process only has one parent process, but may have one or more children processes. This原创 2017-05-29 21:31:45 · 1116 阅读 · 0 评论 -
Window10+Python3.5安装opencv
1.确定Python版本,电脑64位或者32位打开cmd(window键+R,输入cmd就出现),在命令行输入:打开cmd(window键+R,输入cmd就出现),在命令行输入:pythonPython 3.5.2 |Anaconda 4.2.0 (64-bit)| (default, Jul 5 2016, 11:41:13) [MSC v.1900 64 bit (AMD64)] on win原创 2017-05-14 16:47:06 · 11206 阅读 · 3 评论 -
20170401-leetcode-435-Non-overlapping Intervals
1.DescriptionGiven a collection of intervals, merge all overlapping intervals.For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. Given a collection of intervals, merge all ov原创 2017-04-04 15:40:58 · 303 阅读 · 0 评论