<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[W.J.Z]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Leader_wang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Leader_wang]]></copyright><item><title><![CDATA[matlab实现FCM算法]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/90488143</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/90488143</guid><author>Leader_wang</author><pubDate>Thu, 23 May 2019 21:15:04 +0800</pubDate><description><![CDATA[% author:wangjunzuo
% date:2019/5/21
% fuction:fcm algrithmn

load data 
load label
maxgen = 100;  %??????
m = 2;         %2??
threshold = 10e-1000;   %?????
cluster_n = 3;       %????

%%%%%%%%%...]]></description><category></category></item><item><title><![CDATA[2018网易球队编程题]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/89389531</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/89389531</guid><author>Leader_wang</author><pubDate>Thu, 18 Apr 2019 22:14:51 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[YARN配置]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/89374011</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/89374011</guid><author>Leader_wang</author><pubDate>Thu, 18 Apr 2019 10:54:54 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[线性降维和PCA]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/89356405</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/89356405</guid><author>Leader_wang</author><pubDate>Wed, 17 Apr 2019 15:03:45 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[大整数相乘]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/89218332</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/89218332</guid><author>Leader_wang</author><pubDate>Thu, 11 Apr 2019 19:37:37 +0800</pubDate><description><![CDATA[问题描述
有两个用字符串表示的非常大的大整数,算出他们的乘积，也是用字符串表示。不能用系统自带的大整数类型。


解决思路
先进行相乘，然后进行存储，最后考虑进位。


#include&lt;iostream&gt;
#include&lt;string&gt;

#define MAX 1000
using namespace std;

int main()
{
    string s...]]></description><category></category></item><item><title><![CDATA[Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/89179102</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/89179102</guid><author>Leader_wang</author><pubDate>Wed, 10 Apr 2019 12:09:52 +0800</pubDate><description><![CDATA[Given n points on a 2D plane, find the maximum number of points that lie on the same
straight line.




]]></description><category></category></item><item><title><![CDATA[2018拼多多笔试最大乘积问题（与网易合唱团动态规划相似）]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/89163963</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/89163963</guid><author>Leader_wang</author><pubDate>Tue, 09 Apr 2019 22:07:30 +0800</pubDate><description><![CDATA[给定一个无序数组，包含正数、负数和0，要求从中找出3个数的乘积，使得乘积最大，要求时间复杂度：O(n)，空间复杂度：O(1)
动态规划算法

#include&lt;iostream&gt;
#include&lt;vector&gt;
using namespace std;
#define MAX 10000
inline long long max(long  long a,long lo...]]></description><category></category></item><item><title><![CDATA[git简单实用总结]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/89141784</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/89141784</guid><author>Leader_wang</author><pubDate>Tue, 09 Apr 2019 12:02:35 +0800</pubDate><description><![CDATA[本文介绍了git的安装、配置、基本命令、分支和参与开源项目的操作，文中绝大部分为命令行，该笔记是用于复习而非普及知识，所以未添加详细的图片，所以仅供大家快速查找复习使用。]]></description><category></category></item><item><title><![CDATA[latex 常见论文操作总结（second edition）]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88996922</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88996922</guid><author>Leader_wang</author><pubDate>Wed, 03 Apr 2019 15:37:03 +0800</pubDate><description><![CDATA[本次版本在第一版的基础上增加了一些复杂命令，整片内容包括latex 中文支持、文章结构、图标、公式、引用、算法、转置等操作命令，匆匆完成本篇文章的编写，如有不足之处多多谅解。从本学期起每篇文章都是现在latex上编写后转换为图片，这样方便我进行复习和备份，同时也方便观看者打印。]]></description><category></category></item><item><title><![CDATA[公式求解]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88900142</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88900142</guid><author>Leader_wang</author><pubDate>Fri, 29 Mar 2019 19:21:39 +0800</pubDate><description><![CDATA[问题：”Evaluate the value of an arithmetic expression in Reverse Polish Notation.
Valid operators are+,-,*,/. Each operand may be an integer or another expression.
Some examples:
举例：[“2”, “1”, “+”, “3”,...]]></description><category></category></item><item><title><![CDATA[非递归求而二叉树最短路径深度]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88878120</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88878120</guid><author>Leader_wang</author><pubDate>Thu, 28 Mar 2019 21:00:59 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[动态规划 &&网易合唱团笔试]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88872479</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88872479</guid><author>Leader_wang</author><pubDate>Thu, 28 Mar 2019 16:44:23 +0800</pubDate><description><![CDATA[问题描述：
有 n 个学生站成一排，每个学生有一个能力值，牛牛想从这 n 个学生中按照顺序选取 k 名学生，要求相邻两个学生的位置编号的差不超过 d，使得这 k 个学生的能力值的乘积最大，你能返回最大的乘积吗？







...]]></description><category></category></item><item><title><![CDATA[动态规划]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88781280</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88781280</guid><author>Leader_wang</author><pubDate>Sun, 24 Mar 2019 20:21:04 +0800</pubDate><description><![CDATA[简要总结了动态规划的特点及解题步骤，本文中算法是从顶到底进行的，各位可以试着写出从底部到顶部的状态转移公式并写出代码加深理解。


]]></description><category></category></item><item><title><![CDATA[统计学习方法总结]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88751518</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88751518</guid><author>Leader_wang</author><pubDate>Fri, 22 Mar 2019 21:38:52 +0800</pubDate><description><![CDATA[简要介绍了感知机、K近邻法、朴素贝叶斯法、决策树、逻辑斯蒂回归与最大熵模型、支持向量机、提升方法、EM算法、隐马尔可夫模型9种统计学习方法的特点。



...]]></description><category></category></item><item><title><![CDATA[隐马尔可夫模型]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88724077</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88724077</guid><author>Leader_wang</author><pubDate>Thu, 21 Mar 2019 19:46:49 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[EM算法]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88686092</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88686092</guid><author>Leader_wang</author><pubDate>Wed, 20 Mar 2019 12:59:15 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[AdaBoost&提升树]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88662753</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88662753</guid><author>Leader_wang</author><pubDate>Tue, 19 Mar 2019 15:05:10 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[支持向量机]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88559716</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88559716</guid><author>Leader_wang</author><pubDate>Thu, 14 Mar 2019 19:39:12 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[拉格朗日对偶性]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88529989</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88529989</guid><author>Leader_wang</author><pubDate>Wed, 13 Mar 2019 12:42:36 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[无约束最优化问题求解方法]]></title><link>https://blog.youkuaiyun.com/Leader_wang/article/details/88367617</link><guid>https://blog.youkuaiyun.com/Leader_wang/article/details/88367617</guid><author>Leader_wang</author><pubDate>Sat, 09 Mar 2019 16:16:49 +0800</pubDate><description><![CDATA[]]></description><category></category></item></channel></rss>