weixin_43934110的博客

上传不了svg。原地址结合之前对CSS知识框架的整理，这周末把语法规则和布局全部梳理了一遍。学习思路如下：语法规则方面主要是：选择器、单位、@rules，直接过了一遍MDN，其实常用也就那几个。Layout先看的CSS Layout，短小精悍，半小时就能搞定。Flexbox和Grid都看的CSS Tricks，写得真的不错！第一遍边看边写，第二遍就把它整理下来。一共整理了四张XMind: 语法规则、Layout、Flexbox、Grid，其中Layout里面主要是传统的布局方案，而Flexbo

运输层主要集中在TCP和UDP，其中难点是TCP是如何确保可靠数据传输的1.关于TCP差错恢复机制到底是怎么样的，书也没讲清楚，只是说一种GBN和SR的结合。。。之后还要研究一下2.GBN和SR要多画图，想想出现不同情况的差错是如何处理的就清楚了。3.TCP和UDP的报文结构要画图4.三次握手和四次挥手，想想每一次如果出错了会怎么样，而不是只知道每一次发什么，回什么5.关注下运输层针对TCP的攻击(SYN,RST…)下面是思维导图（略大）...

整理了一下应用层的知识，真的很碎，之后会根据重点再修改。

引擎是如何运作的这是我目前为止对JavaScript编译原理（不考虑优化）的大致理解:词法作用域这其中我们着重关注词法作用域的规则，包括var/let的区别，提升，闭包等概念至此，关于JavaScript词法部分的内容基本告一段落。...

Javascript语言详解，第二篇 || 同时也是浏览器架构的第一篇简单的JavascriptJavascript是一门weird language。它在某些地方以某种方式运行着，但你就是无法完全、彻底理解它。对于C/C++/Java这样的静态/编译型语言（强类型语言），我们清楚它是由gcc通过编译将源代码转换为二进制代码，当运行程序的时候，连接器把程序从硬盘复制到内存中并且运行。即使是python这样的动态/解释型语言（弱类型语言），也拥有自己特定的解释器把源代码转换成字节码的中间形式，然后.

1.数据类型Null, undefined, boolean, number, string, symbol(es6),bigint(es6),object1.1 number和bigintnumberjs以64位浮点数(IEEE754)的形式储存number转换规则如下：6.5=110.12=1.101∗24=−10∗(1+0.101)∗21025−1023=(−1)sign∗(1+fraction)∗2exponent−10236.5 = 110.1_2 = 1.101*2^4 = -1

这学期的团队项目比较多，这里????一下常用的git命令，免得每次都去查Init locally and push to GitHubfrom scrach#config your name and emailgit config --global --user.name abcgit config --global --user.email 123@abc.com#list if you had done itgit config --global --list #show your u

不得不说，在对大量数据查找和修改时，正则表达式非常简单易用，当然它的用途远不止此，也远没有这么简单。但在平时编程中，使用一些简单的Regex能够极大提高效率。因此这里简单总结一下基础的正则表达式(Regex)语法，方便以后查找使用。目的表达式例子匹配单个字符.a.o匹配abo,aco,ado…，不能匹配abbo匹配前面任意个表达式（尽可能多）*a*o匹配o,ao,aao,aaao匹配前面至少1个表达式(尽可能多)+a+o匹配ao, aao,aaao，不能匹配

问题为了将一个python的深度学习项目移植到Web端通过命令行使用tensorflowjs_converter将由keras训练得到的h5文件模型转换为TF.js层# bashtensorflowjs_converter --input_format keras \ path/to/my_model.h5 \ path/to/tfjs_target_dir转换成功后得到两个文件model.json和gr

Given a non-empty, singly linked list with head node head, return a middle node of linked list.If there are two middle nodes, return the second middle node.Example 1:Input: [1,2,3,4,5]Output: Node...

Given an integer array arr, count element x such that x + 1 is also in arr.If there’re duplicates in arr, count them seperately.Example 1:Input: arr = [1,2,3]Output: 2Explanation: 1 and 2 are cou...

Given an array of strings, group anagrams together.Example:Input: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”],Output:[[“ate”,“eat”,“tea”],[“nat”,“tan”],[“bat”]]Note:All inputs will be in lowe...

Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one...

Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.Example:Input: [0,1,0,3,12]Output: [1,3,12,0,0]Note:You must d...

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:...

Write an algorithm to determine if a number n is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares ...

Day 1 Single NumberGiven a non-empty array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you imple...

Werewolf（狼人杀） is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game,player #1 said: “Player #2 is a werewolf.”;player #2 said: ...

树一、引言：1. 二分查找/*二分查找 引出树*/int BinarySearch(ElementType A[] , int N , ElementType K){ int left , right , mid ,Notfound ; Notfound = -1 ; left = 0 ; right = N - 1 ; while( left ...