<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[pjsfirstlaw的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/pjsfirstlaw</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; pjsfirstlaw]]></copyright><item><title><![CDATA[NLP_Unix命令_第一节练习(1)]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/88094858</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/88094858</guid><author>pjsfirstlaw</author><pubDate>Sun, 03 Mar 2019 23:33:53 +0800</pubDate><description><![CDATA[NLP第一节练习
文本无处不在，我们可以利用Unix的命令行做一些简单的操作，有的甚至比编写python程序要快得多。

]]></description><category></category></item><item><title><![CDATA[NLP_Unix命令_第一节练习(2)]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/88095761</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/88095761</guid><author>pjsfirstlaw</author><pubDate>Sun, 03 Mar 2019 22:53:34 +0800</pubDate><description><![CDATA[NLP第一节练习(2)
文本无处不在，我们可以利用Unix的命令行做一些简单的操作，有的甚至比编写python程序要快得多。
用到的Unix命令

]]></description><category></category></item><item><title><![CDATA[系统分析Week1_HW]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/88075131</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/88075131</guid><author>pjsfirstlaw</author><pubDate>Sat, 02 Mar 2019 13:48:18 +0800</pubDate><description><![CDATA[1.简答题

]]></description><category></category></item><item><title><![CDATA[编译原理项目]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85333008</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85333008</guid><author>pjsfirstlaw</author><pubDate>Sat, 29 Dec 2018 00:14:41 +0800</pubDate><description><![CDATA[PLO编译器分析
PL0文法


Program → Block.



Block → [ConstDecl][VarDecl][ProcDecl] Stmt
程序块的基本结构是：常量定义、变量定义、过程定义、语句


ConstDecl → const ConstDef {, ConstDef} ;
常量定义


ConstDef → ident = number


VarDecl → va...]]></description><category></category></item><item><title><![CDATA[BP神经网络实验报告]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85040908</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85040908</guid><author>pjsfirstlaw</author><pubDate>Wed, 26 Dec 2018 12:29:10 +0800</pubDate><description><![CDATA[BP神经网络实验报告
实验要求
构造一个三层的BP神经网络，完成手写0-9数字的识别
实验步骤

从网上下载MNIST数据集
从官网上得到的数据集有4个，以IDX3-UBYTE的文件类型保存


train-images.idx3-ubyte 图片训练集，包含6万个数据图片
train-labels.idx1-ubyte 标签训练集，对应图片训练集的标签
t10k-images-idx3-ubyt...]]></description><category></category></item><item><title><![CDATA[使用模拟退火与禁忌搜索解决Capacitated Facility Location Problem]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85208123</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85208123</guid><author>pjsfirstlaw</author><pubDate>Sun, 23 Dec 2018 11:12:22 +0800</pubDate><description><![CDATA[Capacitated Facility Location Problem
问题描述
Suppose there are n facilities and m customers. We wish to choose:
(1) which of the n facilities to open
(2) the assignment of customers to facilities
The ob...]]></description><category></category></item><item><title><![CDATA[Week15]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85042317</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/85042317</guid><author>pjsfirstlaw</author><pubDate>Sun, 16 Dec 2018 23:11:45 +0800</pubDate><description><![CDATA[Week15
Dynamic Programming
question source: Integer Break
question description
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those int...]]></description><category></category></item><item><title><![CDATA[Week14 Perfect Squares]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84933171</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84933171</guid><author>pjsfirstlaw</author><pubDate>Sun, 09 Dec 2018 22:36:32 +0800</pubDate><description><![CDATA[Week14
Dynamic Programming
question source: Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.
question descripti...]]></description><category></category></item><item><title><![CDATA[期中项目设计文档]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84678896</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84678896</guid><author>pjsfirstlaw</author><pubDate>Tue, 04 Dec 2018 22:56:01 +0800</pubDate><description><![CDATA[计网期中项目设计文档
写一个网络应用LFTP，该应用支持互联网中的两台计算机进行大文件传输
需求

使用UDP协议传输，但要求像TCP一样完全可靠

实现方法：
使用回退N步（GBN）协议，允许发送方发送多个分组，而不需要等待确认。
UDP是不可靠传输的，它所收到的数据是无序的，也有可能在中途丢包。而在GBN协议中，接收方丢弃所有失序分组，确保其像TCP一样可靠。

实现流控制
流控制，是让发送方...]]></description><category></category></item><item><title><![CDATA[Week13 House Robber]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84729749</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84729749</guid><author>pjsfirstlaw</author><pubDate>Sun, 02 Dec 2018 23:46:33 +0800</pubDate><description><![CDATA[Week13
Dynamic Programming
question source: House Robber
question description
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the...]]></description><category></category></item><item><title><![CDATA[Week12 Gas Station]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84404880</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84404880</guid><author>pjsfirstlaw</author><pubDate>Fri, 23 Nov 2018 23:08:46 +0800</pubDate><description><![CDATA[Week12
Greedy
question source: Gas Station
question description
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].
You have a car with an unlimited gas ta...]]></description><category></category></item><item><title><![CDATA[Week11]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84206003</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/84206003</guid><author>pjsfirstlaw</author><pubDate>Sun, 18 Nov 2018 22:31:03 +0800</pubDate><description><![CDATA[Week11
Dynamic Programming
question source: Maximal Square
question description
Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.
**Exa...]]></description><category></category></item><item><title><![CDATA[week10]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83042855</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83042855</guid><author>pjsfirstlaw</author><pubDate>Wed, 07 Nov 2018 23:56:27 +0800</pubDate><description><![CDATA[中山大学数据科学与计算机学院本科生实验报告
（2018年秋季学期）




课程名称
手机平台应用开发
任课老师
郑贵锋




年级
16
专业（方向）
计算机应用


学号
16340176
姓名
潘鉴


电话
136903794757
Email
903794757@qq.com


开始日期
2018年10月10日
完成日期
2018年10月13日



一、实验题目
实验一：中山大学智...]]></description><category></category></item><item><title><![CDATA[Week9]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83629042</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83629042</guid><author>pjsfirstlaw</author><pubDate>Thu, 01 Nov 2018 23:48:56 +0800</pubDate><description><![CDATA[Week9
Dynamic Programming
question source: Coin Change
question description
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest nu...]]></description><category></category></item><item><title><![CDATA[Week8]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83479693</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83479693</guid><author>pjsfirstlaw</author><pubDate>Sun, 28 Oct 2018 23:00:22 +0800</pubDate><description><![CDATA[Week8
Greedy
question source: IPO
question description
Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some pro...]]></description><category></category></item><item><title><![CDATA[Week7]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83185113</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83185113</guid><author>pjsfirstlaw</author><pubDate>Fri, 19 Oct 2018 17:02:01 +0800</pubDate><description><![CDATA[Week7
Greedy
question source: Jump Game
question description
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents...]]></description><category></category></item><item><title><![CDATA[Week6]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83034251</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/83034251</guid><author>pjsfirstlaw</author><pubDate>Fri, 12 Oct 2018 23:45:15 +0800</pubDate><description><![CDATA[Week6
Graph
question source: K-Similary Strings
question description
Strings A and B are K-similar (for some non-negative integer K) if we can swap the positions of two letters in A exactly K times so...]]></description><category></category></item><item><title><![CDATA[Week5]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/82957265</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/82957265</guid><author>pjsfirstlaw</author><pubDate>Sun, 07 Oct 2018 12:26:49 +0800</pubDate><description><![CDATA[Week5
Graph
question source: Find Eventual Safe States
question description
In a directed graph, we start at some node and every turn, walk along a directed edge of the graph.  If we reach a node that...]]></description><category></category></item><item><title><![CDATA[Week4 Is Graph Bipartite]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/82903722</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/82903722</guid><author>pjsfirstlaw</author><pubDate>Sat, 29 Sep 2018 22:39:08 +0800</pubDate><description><![CDATA[Week4(2)
上周犯了个小错误，在写第3周的博客时，不小心直接在第2周的博客上改了，然后第2周的博客直接被第3周的覆盖了，所以这周写2篇补回来。
Graph
question source: Is Graph Bipartite?
question description
Given an undirected graph, return true if and only if it is b...]]></description><category></category></item><item><title><![CDATA[Week3]]></title><link>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/82903364</link><guid>https://blog.youkuaiyun.com/pjsfirstlaw/article/details/82903364</guid><author>pjsfirstlaw</author><pubDate>Sat, 29 Sep 2018 21:58:01 +0800</pubDate><description><![CDATA[Week4
上周犯了个小错误，在写第3周的博客时，不小心直接在第2周的博客上改了，然后第2周的博客直接被第3周的覆盖了，所以这周写2篇补回来。
Graph
question source: Network Delay Time
question description
There are N network nodes, labelled 1 to N.
Given times, a list o...]]></description><category></category></item></channel></rss>