- 博客(20)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 运筹帷幄：围棋高手
强化学习走棋网络监督学习策略网络强化学习基本概念强化学习基本要素强化学习目的强化学习策略网络阿尔法狗的大局观估值网络快速走子网络蒙特卡罗树搜索整合阿尔法元走棋网络监督学习策略网络通过监督学习的方式训练一个策略网络，模拟人类棋手的风格进行落子问题：对·每个样本都进行学习，但不是每个样本都是好的落子方案。阿尔法狗引入强化学习技术，通过自我对弈左右互搏来提升自身棋力强化学习基本概念强化学习相比监督学习而言，它所收到的反馈是评估性的（只告诉当前做法是好的还是坏的）而非指导性的（会告诉该做出什么行
2020-12-14 09:29:33
298
原创 神来之笔：创作图画
创作生成网络生成对抗网络数据空间和数据分布生成网络判别网络训练对抗生成网络固定生成网络，训练判别网络固定判别网络，训练生成网络条件生成对抗网络生成对抗网络由生成网络和判别网络组成生成网络：随机生成观测数据判别网络：判断数据是真是假生成对抗网络的基本思想就是通过生成网络和判别网络之间的相互“对抗”来学习数据空间和数据分布数据空间是数据所在的空间，例如在生成图像这个任务中，数据空间就是一些图像的集合，在图像空间中，每一张图片都是这个空间里的一个点数据在空间中的扽不情况就称为数据分布。生
2020-12-13 15:29:16
171
原创 2020/12/5 PAT甲级第三题
题目不知道去哪里搞，考试就卡在这一题，算法挺简单，但就是不太会读数据，白白错过25分。题目描述输入文档树，给出目标文档结点，输出文档路径（脑瘫dfs），具体见输入输出输入自己拟的数据，大致是介个样子。。。（孩子实在不知道去哪里找原题和测试数据哇）第一行是结点数n，接下来n行，第一行规定是根节点0000，以数字前面空格表示层数，结点编号是四位数字（很自然的想到hash，空间换时间），接着输入m（要求解的问题个数）接着m行，每行一个文档编号130000 1234 4321 3333
2020-12-13 01:33:09
176
原创 识文断字：理解文本
词袋模型词袋模型是用于描述文本的一个简单的数学模型，也是常用的一个简单的数学模型。是由二元组（词语：出现次数）组成的集合停止词 ：不携带任何主题信息的高频词称为停止词。低频词：若过度依赖这样的词语对文章进行分类，那么就可能出现过拟合现象词频率：一个词语在文档中出现的频率。逆文档频率：文档频率是语料库中出现这个词语的文档总数与语料库中所有文档的总数的商。逆文档频率是文档频率的负对数。（在语料库中大不跟文档中都大量出现的词语不重要）将一个词语在某篇文章中的词频率与该词的逆文档频率相乘，可以得
2020-12-12 19:48:06
318
原创 算法笔记一
算法笔记一，输入：除了%c外，scanf对其他个师傅（%d）的输入是以空白符（即空格，换行）为结束标志的scanf的格式是可以读入空格和字符的getchar()：输入单个字符，常用于将输入中每行末尾的换行符吸收掉gets() ：输入一行字符串char str[100];cin.getline(str,100);string str;getline(cin,str);二，数学函数#include<math.h>typedef long long LL;//给l
2020-12-12 00:30:49
140
原创 PAT_AL_1005 Spell It Right
题目链接Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each input file contains one test case. Each case occupies one line which contains an N (≤10100
2020-10-12 17:07:03
71
原创 PAT_AL_1002 A+B for Polynomials
题目链接This time, you are supposed to find A+B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:K N1 aN1 N2 aN2
2020-10-12 17:00:56
107
原创 PAT_AL_1001 A+B Format
题目链接Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).Input Specification:Each input file contains one test case. Each case contains a pair
2020-10-12 16:54:54
100
原创 LeetCode 543. Diameter of Binary Tree
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.Example:Given a binary treeR
2020-09-30 21:23:59
65
原创 LeetCode 581. Shortest Unsorted Continuous Subarray
Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You need to find the shortest such subarray and output its length.Example
2020-09-30 17:06:57
46
原创 LeetCode 617. Merge Two Binary Trees
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum n
2020-09-30 09:37:30
61
原创 LeetCode 53.Maximum Subarray
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanation: [4,-1,2,1] has the largest sum = 6.Follow up:If you h
2020-08-29 18:40:01
108
原创 LeetCode 86. Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.You should preserve the original relative order of the nodes in each of the two partitions.Example:Input: head = 1->4->3-&
2020-08-06 17:27:03
74
原创 LeetCode 82. Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.Return the linked list sorted as well.Example 1:Input: 1->2->3->3->4->4->5Output: 1->2->5Example 2:
2020-08-06 16:28:38
64
原创 LeetCode 61. Rotate List
Given a linked list, rotate the list to the right by k places, where k is non-negative.Example 1:Input: 1->2->3->4->5->NULL, k = 2Output: 4->5->1->2->3->NULLExplanation:rotate 1 steps to the right: 5->1->2->3->
2020-08-06 15:21:51
70
原创 LeetCode 24. Swap Nodes in Paris
Given a linked list, swap every two adjacent nodes and return its head.You may not modify the values in the list’s nodes, only nodes itself may be changed.Example:Given 1->2->3->4, you should return the list as 2->1->4->3.难度：中等看到题目第一
2020-08-06 14:22:23
67
原创 LeetCode 21.Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new sorted list. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4Output: 1->1->2->3->4->4难度：简单/** * Definitio
2020-08-06 13:35:32
79
原创 LeetCode 19.Remove Nth Node From End of List
Given a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the linked list becomes 1->2->3->5.Note:Given n wi
2020-08-05 23:20:29
189
原创 LeetCode 2.Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.You may assume the two numbers do no
2020-08-05 17:44:34
74
原创 数据库系统概念-SQL
《数据库系统概念》SQLSQL语言概览SQL数据定义SQL查询的基本结构附加的基本运算聚集函数嵌套子查询数据库的自动保存SQL第一次写博客，大二暑假重啃水过的数据库。。。学习《数据库系统概念》由于之前学过，故对一些基础概念不再详细描述。SQL语言概览SQL语言有以下几个部分数据定义语言：DDL 定义关系模式，删除关系以及修改关系模式 ；数据操纵语言：DML 查询数据，插入，删除，修改；完整性 SQL DDL包括定义完整性约束的命令，保存在数据库中的数据必须满足所有的完整性约束。保存
2020-07-29 21:14:02
287
数字逻辑课设交通灯.rar
2020-03-04
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人