python
lgz583
这个作者很懒,什么都没留下…
展开
-
剑指offer习题一
# -*- coding:utf-8 -*-class Solution: # array 二维列表 def Find(self, target, array): # write code here if(array == [[]]): return 0 raw = len(array) co...原创 2018-06-23 10:57:05 · 150 阅读 · 0 评论 -
mac下 spyder 注释与反注释
command + 1 行注释与反注释command +4 块注释与反注释原创 2018-09-28 13:48:52 · 1510 阅读 · 0 评论 -
剑指offer习题41-50
41:# -*- coding:utf-8 -*-class Solution: def FindContinuousSequence(self, tsum): # write code here result = [] count = 0 for i in range(1,tsum//2+1): c...原创 2018-07-05 17:42:42 · 128 阅读 · 0 评论 -
剑指offer习题20-30
20:# -*- coding:utf-8 -*-class Solution: def __init__(self): self.stack = [] self.minpoint = [] def push(self, node): # write code here if len(self.stack) == ...原创 2018-06-28 22:29:14 · 94 阅读 · 0 评论 -
剑指offer习题31-40
31:# -*- coding:utf-8 -*-import mathclass Solution: def NumberOf1Between1AndN_Solution(self, n): # write code here #本题我举例13 #high/10 代表真正的高位,比如n=1234,看百位,high = math.fl...原创 2018-07-01 10:39:51 · 125 阅读 · 0 评论 -
剑指offer习题9-19
# -*- coding:utf-8 -*-class Solution: def jumpFloorII(self, number): # write code here if number == 1: return 1 elif number == 2: return 2 ...原创 2018-06-25 17:49:23 · 109 阅读 · 0 评论 -
剑指offer习题8
class Solution: def jumpFloor(self, number): # write code here if number == 1: return 1 if number == 2: return 2 lst = [1,2] i = 2 ...原创 2018-06-24 00:11:18 · 112 阅读 · 0 评论 -
剑指offer习题7
class Solution: def Fibonacci(self, n): # write code here if n == 0: return 0 if n == 1: return 1 lst = [0,1] i = 2 while i ...原创 2018-06-23 23:46:40 · 158 阅读 · 0 评论 -
剑指offer习题6
# -*- coding:utf-8 -*-class Solution: def minNumberInRotateArray(self, rotateArray): # write code here if len(rotateArray) == 0: return 0 min_b = rotateArray[0...原创 2018-06-23 23:17:29 · 80 阅读 · 0 评论 -
剑指offer习题五
# -*- coding:utf-8 -*-class Solution: def __init__(self): self.stackA = [] self.stackB = [] def push(self, node): # write code here self.stackA.appen...原创 2018-06-23 17:30:27 · 175 阅读 · 1 评论 -
剑指offer习题四
# -*- coding:utf-8 -*-# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution: # 返回构造的TreeNode根节点 def reCon...原创 2018-06-23 17:03:40 · 89 阅读 · 0 评论 -
剑指offer习题三
非递归版:# -*- coding:utf-8 -*-# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: # 返回从尾部到头部的列表值序列,例如[1,2,3] def printListFromTailTo...原创 2018-06-23 16:21:14 · 116 阅读 · 0 评论 -
剑指offer习题二
# -*- coding:utf-8 -*-class Solution: # array 二维列表 def replaceSpace(self, s): # write code here new = "" flag = 0 for i in s: if (i == " "): ...原创 2018-06-23 11:42:46 · 103 阅读 · 0 评论 -
微博情感分析 多分类
中文八分类贝叶斯数据为(30000,2)训练:import pandas as pdimport jiebafrom sklearn.feature_extraction.text import CountVectorizerfrom sklearn.naive_bayes import MultinomialNBfrom sklearn.externals import j...原创 2019-03-23 10:31:58 · 2644 阅读 · 1 评论