python
zyaphone
这个作者很懒,什么都没留下…
展开
-
Tkinter控件使用image的问题
写一个gui的小程序,想在Button控件里插入一张图片photo=PhotoImage(file=self.path + '/1.gif')wifi_button = Label(top_frame, text="WIFI",image=photo)gif格式图片没有问题,但是png及jpg格式无法插入,报错:_tkinter.TclError: couldn't recognize data原创 2016-03-02 12:50:46 · 15918 阅读 · 0 评论 -
使用Matplotlib绘图
使用matplotlib绘图这两天写论文需要绘图,才发现原来python下还有matplotlib这么个好用的轮子,记录一下。首先看一下matplotlib的介绍:matplotlib 是python最著名的绘图库,它提供了一整套和matlab相似的命令API,十分适合交互式地进行制图。而且也可以方便地将它作为绘图控件,嵌入GUI应用程序中。它的文档相当完备,并且 Gallery页面 中有上百幅原创 2016-02-22 22:17:21 · 487 阅读 · 0 评论 -
Lintcode:wiggle-sort
Lintcode:wiggle-sort没啥特别的,另一种形式的冒泡排序。 先把答案做出来,下一步想想怎么优化,留个坑先。class Solution(object): """ @param {int[]} nums a list of integer @return nothing, modify nums in-place instead """ def原创 2016-03-17 14:28:12 · 304 阅读 · 0 评论 -
LintCode:快乐数
LintCode:快乐数Python代码class Solution: # @param {int} n an integer # @return {boolean} true if this is a happy number or false n_list = [] def isHappy(self, n): # Write your code h原创 2016-03-22 15:54:24 · 499 阅读 · 0 评论 -
Lintcode:买卖股票的最佳时机
Lintcode:买卖股票的最佳时机class Solution: """ @param prices: Given an integer array @return: Maximum profit """ def maxProfit(self, prices): # write your code here if(len(pr原创 2016-04-07 15:47:40 · 356 阅读 · 0 评论 -
LintCode: 带环链表 II
LintCode: 带环链表 II"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ @param head: T原创 2016-04-25 13:42:48 · 271 阅读 · 0 评论 -
LintCode:装最多水的容器
LintCode:装最多水的容器class Solution: # @param heights: a list of integers # @return: an integer def maxArea(self, heights): # write your code here if len(heights) == 0:原创 2016-04-25 20:36:53 · 407 阅读 · 0 评论 -
LintCode:Ugly Number
LintCode:Ugly Numberclass Solution: # @param {int} num an integer # @return {boolean} true if num is an ugly number or false def isUgly(self, num): # Write your code here if原创 2016-04-25 20:49:10 · 288 阅读 · 0 评论 -
LintCode:Paint House
LintCode:Paint Houseclass Solution: # @param {int[][]} costs n x 3 cost matrix # @return {int} an integer, the minimum cost to paint all houses def minCost(self, costs): # Write you原创 2016-04-25 21:56:11 · 380 阅读 · 0 评论 -
LintCode:Left Pad
LintCode:Left Pad这里写链接内容class StringUtils: # @param {string} originalStr the string we want to append to # @param {int} size the target length of the string # @param {string} padChar the ch原创 2016-04-25 23:11:52 · 749 阅读 · 0 评论 -
LintCode: Paint House II
LintCode: Paint House II最简单的穷举法,可惜超时了,先留个坑~class Solution: # @param {int[][]} costs n x k cost matrix # @return {int} an integer, the minimum cost to paint all houses def minCostII(self, co原创 2016-04-25 23:50:49 · 511 阅读 · 0 评论 -
LintCode:等价二叉树
LintCode:等价二叉树如果一棵树前、中、后序遍历结果都一样的话肯定就是等价的了。"""Definition of TreeNode:class TreeNode: def __init__(self, val): this.val = val this.left, this.right = None, None"""class Solution:原创 2016-04-26 00:27:12 · 754 阅读 · 0 评论 -
LintCode:最长上升连续子序列
LintCode:最长上升连续子序列class Solution: # @param {int[]} A an array of Integer # @return {int} an integer def longestIncreasingContinuousSubsequence(self, A): # Write your code here原创 2016-04-26 10:35:38 · 465 阅读 · 0 评论 -
LintCode:最长回文子串
LintCode:最长回文子串 需要引入一个二维数组M[i]来记录字符串与反转后的字符串的重复状态,以字符串abcdzdcab 为例,M[i]如下图所示: 然后只需要找到M[i]上最长的连续1的个数就是最长回文字符串的长度,记住位置,再在原来的字符串上截取一可以了。class Solution: # @param {string} s input string # @retu原创 2016-04-26 13:55:09 · 449 阅读 · 0 评论 -
LintCode:最长无重复字符的子串
LintCode:最长无重复字符的子串class Solution: # @param s: a string # @return: an integer def lengthOfLongestSubstring(self, s): # write your code here L = [] max_len = 0原创 2016-04-26 20:56:25 · 247 阅读 · 0 评论 -
LintCode: 合并排序数组
LintCode: 合并排序数组class Solution: #@param A and B: sorted integer array A and B. #@return: A new sorted integer array def mergeSortedArray(self, A, B): # write your code here原创 2016-04-26 21:39:34 · 243 阅读 · 0 评论 -
LintCode:平衡二叉树
LintCode:平衡二叉树"""Definition of TreeNode:class TreeNode: def __init__(self, val): self.val = val self.left, self.right = None, None"""class Solution: """ @param root: The原创 2016-04-26 22:42:48 · 677 阅读 · 0 评论 -
LintCode:数组划分
LintCode:数组划分一前一后两根指针,当前面的指针大于k且后指针小于k时,交换两个指针的值,走到两根指针相遇。class Solution: """ @param nums: The integer array you should partition @param k: As description @return: The index after parti原创 2016-04-26 23:39:36 · 441 阅读 · 0 评论 -
LintCode:字符大小写排序
LintCode:字符大小写排序双指针。class Solution: """ @param chars: The letters array you should sort. """ def sortLetters(self, chars): # write your code here m = 0 n = len(c原创 2016-04-26 23:46:20 · 449 阅读 · 0 评论 -
LintCode:删除元素
LintCode:删除元素class Solution: """ @param A: A list of integers @param elem: An integer @return: The new length after remove """ def removeElement(self, A, elem): # write原创 2016-04-28 01:12:47 · 323 阅读 · 0 评论 -
LintCode:x的平方根
LintCode:x的平方根Pythonclass Solution: """ @param x: An integer @return: The sqrt of x """ def sqrt(self, x): # write your code here m = x while m * m != x:原创 2016-05-10 12:15:54 · 455 阅读 · 0 评论 -
LintCode:乘积最大子序列
LintCode:乘积最大子序列Pythonclass Solution: # @param nums: an integer[] # @return: an integer def maxProduct(self, nums): # write your code here if len(nums) == 0: ret原创 2016-05-10 17:18:45 · 391 阅读 · 0 评论 -
LintCode:买卖股票的最佳时机 II
LintCode:买卖股票的最佳时机 II贪心算法,只要后一天的价格大于前一天的价格就买入。Pythonclass Solution: """ @param prices: Given an integer array @return: Maximum profit """ def maxProfit(self, prices): # writ原创 2016-05-10 18:24:26 · 411 阅读 · 0 评论 -
LintCode: 将二叉树拆成链表
LintCode: 将二叉树拆成链表Python"""Definition of TreeNode:class TreeNode: def __init__(self, val): this.val = val this.left, this.right = None, None"""class Solution: # @param root:原创 2016-05-10 19:17:09 · 1009 阅读 · 0 评论 -
LintCode: 矩阵归零
LintCode: 矩阵归零Pythonclass Solution: """ @param matrix: A list of lists of integers @return: Nothing """ def setZeroes(self, matrix): # write your code here row = []原创 2016-05-10 19:54:22 · 730 阅读 · 0 评论 -
LintCode:空格替换
LintCode:空格替换注意事项如果使用 Java 或 Python, 程序中请用字符数组表示字符串。Python方法一:这个方法没有使用字符数组,直接使用的字符串数组,虽然能通过,但是不符合要求,看方法2吧。class Solution: # @param {char[]} string: An array of Char # @param {int} length: The t原创 2016-05-10 22:06:56 · 940 阅读 · 0 评论 -
LintCode:落单的数 III
LintCode:落单的数 IIIPythonclass Solution: """ @param A : An integer array @return : Two integer """ def singleNumberIII(self, A): # write your code here A = sorted(A)原创 2016-05-10 22:34:22 · 405 阅读 · 0 评论 -
LintCode:有效数字
LintCode:有效数字人生苦短,我用Python!class Solution: # @param {string} s the string that represents a number # @return {boolean} whether the string is a valid number def isNumber(self, s): #原创 2016-04-28 21:42:49 · 680 阅读 · 0 评论 -
LintCode:中位数
LintCode:中位数Pythonclass Solution: """ @param nums: A list of integers. @return: An integer denotes the middle number of the array. """ def median(self, nums): # write your c原创 2016-05-11 14:16:52 · 1317 阅读 · 0 评论 -
LintCode:Swap Two Nodes in Linked List
LintCode:Swap Two Nodes in Linked List# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: # @param {原创 2016-05-11 16:05:16 · 453 阅读 · 0 评论 -
LintCode:二叉树的层次遍历
LintCode:二叉树的层次遍历方法一:二叉树的层序遍历,需要借助两个栈空间。"""Definition of TreeNode:class TreeNode: def __init__(self, val): self.val = val self.left, self.right = None, None""""""Definition of原创 2016-05-11 18:27:11 · 513 阅读 · 1 评论 -
LintCode:线段树的查询
LintCode:线段树的查询"""Definition of SegmentTreeNode:class SegmentTreeNode: def __init__(self, start, end, max): self.start, self.end, self.max = start, end, max self.left, self.right原创 2016-05-11 20:57:38 · 344 阅读 · 0 评论 -
LintCode:最长上升子序列
LintCode:最长上升子序列LIS转化为LCS问题,动态规划。Pythonclass Solution: """ @param nums: The integer array @return: The length of LIS (longest increasing subsequence) """ def longestIncreasingSubseq原创 2016-05-11 21:46:10 · 303 阅读 · 0 评论 -
LintCode:旋转字符串
LintCode:旋转字符串Pythonclass Solution: # @param s: a list of char # @param offset: an integer # @return: nothing def rotateString(self, s, offset): # write you code here i原创 2016-05-12 00:28:59 · 662 阅读 · 0 评论 -
LintCode:丢失的第一个正整数
LintCode:丢失的第一个正整数Pythonfrom time import sleepclass Solution: # @param A, a list of integers # @return an integer def firstMissingPositive(self, A): # write your code here i原创 2016-05-12 12:34:54 · 271 阅读 · 0 评论 -
LintCode:图中两个点之间的路线
LintCode:图中两个点之间的路线Python# Definition for a Directed graph node# class DirectedGraphNode:# def __init__(self, x):# self.label = x# self.neighbors = []class Solution: """原创 2016-05-12 14:50:51 · 506 阅读 · 0 评论 -
LintCode: 三数之和
LintCode: 三数之和class Solution: """ @param numbersbers : Give an array numbersbers of n integer @return : Find all unique triplets in the array which gives the sum of zero. """ def th原创 2016-05-12 17:45:41 · 395 阅读 · 0 评论 -
LintCode:子数组之和
LintCode:子数组之和方法一:O(n^2)复杂度:Pythonclass Solution: """ @param nums: A list of integers @return: A list of integers includes the index of the first number and the index of the l原创 2016-05-12 19:35:32 · 683 阅读 · 0 评论 -
LintCode:主元素 III
LintCode:主元素 IIIPythonclass Solution: """ @param nums: A list of integers @param k: As described @return: The majority number """ def majorityNumber(self, nums, k): # wr原创 2016-05-12 19:45:29 · 767 阅读 · 0 评论 -
LintCode:重哈希
LintCode:重哈希"""Definition of ListNodeclass ListNode(object): def __init__(self, val, next=None): self.val = val self.next = next"""class Solution: """ @param hashTable: A原创 2016-05-12 20:05:20 · 992 阅读 · 0 评论