Home

密码学基础学习总结-02

密码学基础总结-02 这篇文章中我们将介绍古典密码学和完善保密相关知识,古典密码学就是现在没有人用的加密😂,好吧也不能这么说,如果你是为了故意要让别人解密出来,表白啥的是很好的算法,不过在正经加密不要用,会被锤。完善保密是理论上最完美的加密,但是应该用的地方很少。 凯撒密码 凯撒密码就是移位密码,下面这段解释搬运自维基百科: 凯撒密码的替换方法是通过排列明文和密文字母表,密文字母表示通过将明文字母表向左或向右移动一个固定数目的位置。例如,当偏移量是左移3的时候(解密时的密钥就是3): 明文字母表:ABCDEFGHIJKLMNOPQRSTUVWXYZ 密文字母表:DEFGHIJKLMNOPQRSTUVWXYZABC 使用时,加密者查找明文字母表中需要加密的消息中的每一个字母...

Read more

HCI 论文 Let's Talk About Race Identity Chatbots and AI 翻译

这是我的现代人机交互课老师的布置的作业:翻译并阅读一篇CHI会议的论文,我选择了这篇文章来翻译,感觉文章中的角度很好,在这里也放上来,大部分都是谷歌机翻再加本人猜想法翻译,真有人看的话忍一下我这个菜鸡吧,不过大概没人几个人看这个吧😂 CHI 2018 最佳论文奖获奖论文 CHI 2018, April 21-26, 2018, Montréal, QC, Canada Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies ar...

Read more

Clash Linux 代理的使用教程

Clash Linux 代理使用 前言 Clash是一个很好的代理软件,可是现在有Mac的客户端,有Windows的客户端,还没有Linux的客户端,只有那个原始的clash-linux的软件,没有图形化,而且我也没发现什么可以让这个玩意自动获取订阅的东西,自己照着网上折腾了一个一会儿,现在应该可以正常的使用了,有一个面板可以控制,写了一个脚本可以添加订阅地址,更新文件。 顺便提一下,我现在用的是deepin的系统,电脑上有Python的环境,还有nodejs,我相信看到这篇文章的大概都会安装吧。 软件本体 去clash的github网站上下载linux那个压缩包,解压之后放在一个你能找到的地方,给解压出来的clash-linux赋予权限能够以软件方式运行,在deepin中倒...

Read more

Leetcode 152-Maximum Product Subarray 题解

Leetcode 152-Maximum Product Subarray 题解 题目 Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product. Example 1: Input: [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6. Example 2: Input: [-2,0,-1] Output: 0 Explanation: The result cannot be 2...

Read more

Leetcode 300-Longest Increasing Subsequence 题解

Leetcode 300-Longest Increasing Subsequence 题解 题目 Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4. Note: There may be more than one LIS combination, it is on...

Read more

Leetcode 525-Contiguous Array 题解

Leetcode 525-Contiguous Array 题解 题目 Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1. Example 1: Input: [0,1] Output: 2 Explanation: [0, 1] is the longest contiguous subarray with equal number of 0 and 1. Example 2: Input: [0,1,0] Output: 2 Explanation: [0, 1] (or [1, 0]) is a longe...

Read more

About This Jekyll_theme

TeXt is a super customizable Jekyll theme for personal site, team site, blog, project, documentation, etc. Similar to iOS 11 style, it has large and prominent titles, round buttons and cards. (() => console.log('Hello World!'))(); Features Responsive Semantic HTML Skins Highlight Theme Multi-language support Search Table of...

Read more

Welcome

If you see this page, that means you have setup your site. enjoy! :ghost: :ghost: :ghost: You may want to config the site or writing a post next. Please feel free to create an issue or send me email if you have any questions.

Read more