Einsteinzhao的专栏

原创 leetcode 242. Valid Anagram | Map

# DescriptionGiven two strings s and t, write a function to determine if t is an anagram of s.For example,s = "anagram", t = "nagaram", return true.s = "rat", t = "car", return false

原创 [京东面试问题] 求n=100w个数里面的前k=100个

# 基本思路  最复杂的方法莫过于全部排序, 复杂度nlgn. 结合求100w个数里面最大的一个数(即求max), 不需全排序, 只需开一个变量, 遍历一次记录最大值即可.那么很自然的想到, 求前k个就是开一个k大小的数组, 把历史最大/次大/次次大存起来. 也就是说, 在遍历n的时候, 对于新元素需要和k数组进行对比, 最差的方式是每次遍历k, 总体复杂度在n*k. 如果k数组是已排序的,

原创 leetcode 234. Palindrome Linked List

Reversing a list is not considered “O(1) space” It is a common misunderstanding that the space complexity of a program is just how much the size of additional memory space being used besides input.

原创 leetcode 226. Invert Binary Tree | DFS 递归转迭代

DescriptionInvert a binary tree. 4/ \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max

原创 leetcode 225. Implement Stack using Queues

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. empty() – Ret

原创 leetcode 219. Contains Duplicate II | 滑窗, Set

DescriptionGiven an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is a

原创 leetcode 205. Isomorphic Strings | str中字母计数(dict)与定位

DescriptionGiven two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with an

原创 leetcode 204. Count Primes

DescriptionCount the number of prime numbers less than a non-negative number, n.My solution原始方案 比较朴素的想法就是迭代的找下去, 然后把找到的质数存起来, 对于下一个数, 如果他不能被前面任何一个质数整除, 那这个数也是一个质数(我感觉是这样的). 代码如下:class Solution {pub

原创 leetcode 203. Remove Linked List Elements | 递归的更多理解

DescriptionRemove all elements from a linked list of integers that have value val.Example Given: 1 –> 2 –> 6 –> 3 –> 4 –> 5 –> 6, val = 6 Return: 1 –> 2 –> 3 –> 4 –> 5/** * Definition for singly-lin

原创 leetcode 202. Happy Number | 循环检测

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 s

原创 leetcode 198. House Robber | 动态规划

DescriptionYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adja

原创 极大似然和交叉熵 | 深度学习

接触ML接近一年, 虽有数字信号+统计检测基础知识, 对极大似然仍然一知半解, get不到贝叶斯的思想. DL仍处于探索阶段, 只知道些名次堆砌, 今天开始读<深度学习> 这本书, 着实相见恨晚. 博客将记录个人点滴见解, 聊以备忘. 欢迎交流指正!极大似然 因时间有限+latex技能尚未习得, 下述公式很少很难看概率论中常讲极大似然, 基本任务是对于未知参数theta的指定分布,

原创 leetcode 172. Factorial Trailing Zeroes

DescriptionGiven an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.My solution基本思路是:阶乘中的每个数分解因式, 总共加起来有几个5, 就对应总阶乘末尾有几个0. 最初想法为n/5,

原创 leetcode 169. Majority Element | 摩尔投票法

DescriptionGiven an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority elem

原创 leetcode 168. Excel Sheet Column Title | 进制转化

DescriptionGiven a positive integer, return its corresponding column title as appear in an Excel sheet.For example:1 -> A2 -> B3 -> C...26 -> Z27 -> AA28 -> AB My solution实际上是转化为26进制, 故采用经典的除K取余

原创 leetcode 167. Two Sum II - Input array is sorted

DescrpitionGiven an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two

原创 leetcode 160. Intersection of Two Linked Lists

DescrpitionWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘

原创 leetcode 155. Min Stack | 空间换时间

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()

原创 leetcode 141. Linked List Cycle

DiscriptionGiven a linked list, determine if it has a cycle in it.Follow up: Can you solve it without using extra space?My solution:None检测链表中有无cycle,可以用DPS方法,对每个node做访问过标记{0,1,2},但这需要额外空间.Discuss大神采

原创 leetcode 136. Single Number | XOR的巧妙运用

DescribeGiven an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using

原创 leetcode 125. Valid Palindrome | 回文string

回文str125. Valid PalindromeGiven a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “

原创 leetcode 121. Best Time to Buy and Sell Stock | 最大差值和最大子序列关系

leetcode 121Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the

原创 【LDA|ML】西瓜书习题3.4

from XiguaData import *import numpy as npx, d = load_data_3d0a()# 已知西瓜数据3.0a前8个分类为0，其余分类为1x0 = x[:8]d0 = d[:8]x1 = x[8:]d1 = d[8:]# LDA 线性判别分析miu0 = np.mean(x0, axis=0)miu1 = np.mean(x1, a

原创 【python|ML】k-fold/leave-one-out 方法在对率回归实现（西瓜书习题3.4，数据UCI-iris）

# 经验：梯度下降要让目标确实减小（或者增大），此程序tempsum需要减小，故要着重检查！！import numpy as npdef dlhg(x, d): x = np.c_[x, np.ones(d.shape[0])] w = np.random.randn(x[0].shape[0]) miu = 0.01 temp_sum_old = np.

原创 序列圆卷积和线卷积的关系