# 抓牛---题解

Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0...

# String to Integer (atoi)---题解

Description： Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible...

# SPY NBUT - 1220---题解

Description： The National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’s confidential paper. So the commander of The Nation...

# A - Dinner NBUT - 1217---题解

Description： Little A is one member of ACM team. He had just won the gold in World Final. To celebrate, he decided to invite all to have one meal. As bowl, knife and other tableware is not enough in t...

# Longest Substring Without Repeating Characters---题解

Given a string, find the length of the longest substring without repeating characters.Examples:Given “abcabcbb”, the answer is “abc”, which the length is 3.Given “bbbbb”, the answer is “b”, with the le...

# 统计学习绪论

1 、 损失函数：度量模型一次预测的好坏。 风险函数：度量平均意义下模型预测的好坏。 期望风险函数（期望损失）：是模型关于联合分布的期望损失。 Rexp(f)=Ep[L(Y,f(X))]=⎰x×yL(y,f(x))P(x,y)dxdyR_{exp}(f)=E_p [L(Y,f(X))]= \lmoustache_{\mathcal {x}\times\mathcal {y}}L(y,f(x)...

# 朴素贝叶斯法--简单总结

1、三个重要公式： （1）条件概率： P(A|B)=P(AB)P(B)P(A|B)=\frac{P(AB)}{P(B)} （2）全概率公式： P(A)=∑iP(A|Bi)P(Bi)P(A)=\sum_i P(A|B_i)P(B_i) （3）贝叶斯（Bayes）公式： P(Bi|A)=P(ABi)P(A)=联合概率全概率=P(A|Bi)P(Bi)∑jP(A|Bj)P(Bj)\begin{a...

# k-NN 简单总结

k-NN（k-nearest neighbor）（k近邻法）： 1、适用场景：可用于分类（可用于多分类）和回归。 以下讨论分类问题。 2、综述： 不具有显式的学习过程。 利用训练数据集对特征向量空间进行划分，并作为其分类的模型。 3、**K近邻法的三个基本要素：**k值的选择，距离度量，分类决策规则。 4、基本思想：给定一个训练数据集，对新的输入实例，在训练数据集中找到与该实例最近邻的...

# Tempter of the Bone 题解

The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone w...

# Sticks题解

DescriptionGeorge took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks h...

# 个人小笔记-----c++打开一个txt文本

freopen(“in.txt”,”r”,stdin);...

# 统计学习入门

1、统计学习的三要素：模型，策略，算法 2、回归问题：输入变量与输出变量均为连续变量的预测问题。 分类问题：输出变量为有限个离散变量的预测问题。 标注问题：输入变量与输出变量均为变量序列的预测问题。 3、模型选择方法：正则化与交叉验证。 4、监督学习：指利用训练数据集学习一个模型，再用模型对测试样本集进行预测。即，从给定的有限的训练数据出发，假设数据是独立同分布的，而且假设模型属于某个假设...

# 归并排序

39条 共3页1 2 3 下一页 尾页
个人资料
• 访问：4794次
• 积分：412
• 等级：
• 排名：千里之外
• 原创：37篇
• 转载：1篇
• 译文：0篇
• 评论：5条
文章分类
阅读排行
评论排行
最新评论