<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[望南]]></title><description><![CDATA[慢慢的总结一些在项目中遇到的坑与填坑心得，以及分享和学习一些新的技术]]></description><link>https://blog.youkuaiyun.com/tj310</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; tj310]]></copyright><item><title><![CDATA[javascript - for.of和for.in的区别]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122451948</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122451948</guid><author>tj310</author><pubDate>Wed, 12 Jan 2022 14:30:03 +0800</pubDate><description><![CDATA[定义和用法
for…in

for/in 语句用于循环对象属性。
循环中的代码每执行一次，就会对数组的元素或者对象的属性进行一次操作。

for…of

JavaScript for of 语句循环遍历可迭代对象的值。
它允许您循环遍历可迭代的数据结构，例如数组、字符串、映射、节点列表等：

代码对比


遍历数组
const arr1 = [1, 2, 3, 4, 5]
const arr2 = [{ name: 1 }, { name: 2 }, { name: 3 }]

for (let i in ]]></description><category></category></item><item><title><![CDATA[javascript - 引用类型的比较]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122448656</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122448656</guid><author>tj310</author><pubDate>Wed, 12 Jan 2022 10:53:24 +0800</pubDate><description><![CDATA[const num1 = new Number(1)
const num2 = new Number(2)

console.log(num1 == num2) //false
console.log(num1 === 1) //false
console.log(num1 == 1) //true

let arr1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
let arr2 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
let arr3 = [
  { i]]></description><category></category></item><item><title><![CDATA[javascript - map、filter、reduce区别及使用]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122439928</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122439928</guid><author>tj310</author><pubDate>Tue, 11 Jan 2022 20:04:56 +0800</pubDate><description><![CDATA[定义和用法


map()

map() 方法返回一个新数组，数组中的元素为原始数组元素调用函数处理后的值。
map() 方法按照原始数组元素顺序依次处理元素。

注意： map() 不会对空数组进行检测。map() 不会改变原始数组。


filter

filter() 方法创建一个新的数组，新数组中的元素是通过检查指定数组中符合条件的所有元素。

注意： filter() 不会对空数组进行检测。注意： filter() 不会改变原始数组。


reduce

reduce() 方法接收一个函数作为累加]]></description><category></category></item><item><title><![CDATA[vue 中ts实现mqtt封装]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122436487</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122436487</guid><author>tj310</author><pubDate>Tue, 11 Jan 2022 17:03:49 +0800</pubDate><description><![CDATA[安装mqtt
npm i mqtt

untils/mqtt.ts
import mqtt from 'mqtt'

// 声明mqtt的options数据包类型
export interface MqttconnecOption extends mqtt.IClientOptions {}

// 为方便外部组件处理message,声明消息回调方法类型
export declare type OnMessageFun = (topic: string, payload: Buffer) =&gt; voi]]></description><category></category></item><item><title><![CDATA[配置eslint代码规范]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122410582</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122410582</guid><author>tj310</author><pubDate>Mon, 10 Jan 2022 15:18:59 +0800</pubDate><description><![CDATA[1、vscode安装eslint、Prettier和vetur

2、安装依赖
yarn add eslint prettier eslint-config-prettier eslint-plugin-prettier -D

要实现typescript环境，继续安装如下依赖
yarn add typescript @nuxtjs/eslint-config-typescript @typescript-eslint/eslint-plugin @typescript-eslint/parser -D

]]></description><category></category></item><item><title><![CDATA[leetCode - 无重复字符的最长子串]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122305373</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122305373</guid><author>tj310</author><pubDate>Tue, 04 Jan 2022 16:09:15 +0800</pubDate><description><![CDATA[function lengthOfLongestSubstring(s: string): number {
    //l 左指针  maxLength 最大长度
    let l:number = 0
    let maxLength:number = 0
    // hashMap存储重复字符，以及出现的位置
    const map = new Map()
    // r 右指针 开始遍历
    for (let r:number = 0; r &lt; s.length; r++) {]]></description><category></category></item><item><title><![CDATA[vue3.0中使用 websocket，封装到公共方法]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122298622</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122298622</guid><author>tj310</author><pubDate>Tue, 04 Jan 2022 11:13:15 +0800</pubDate><description><![CDATA[首先创建一个socket.ts文件封装公共方法
/*
 * @Descripttion: 封装socket方法
 * @version:
 * @Date: 2021-08-06 11:14:39
 * @LastEditTime: 2021-10-26 14:06:34
 */
import i18n from '@/locales'
import store from '@/store'
import { ElMessage } from 'element-plus'
import { Base64 }]]></description><category></category></item><item><title><![CDATA[JS实现url地址栏参数拼接、更改或者删除，（根据筛选条件，一个方法实现）]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122208548</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122208548</guid><author>tj310</author><pubDate>Wed, 29 Dec 2021 09:33:03 +0800</pubDate><description><![CDATA[其实主要判断的点有两个，一共三种情况：

判断url参数是否只有一个，使用一个参数的正则匹配
判断多个参数：
1、  判断是否是第一个参数
2、判断是否是第二个参数

这两个点梳理出来就开始实现正则匹配，但是每次匹配的时候要考虑传入的值是否为空，如果为空要按上述两种情况去处理，把值替换为空串，如果不为空，按默认正则模板直接替换
代买实现：

/**
 * @description:
 * @param {string} name:传入的键名，参数名
 * @param {any} value：传入的值
 *]]></description><category></category></item><item><title><![CDATA[leetCode -爬楼梯]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122168228</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122168228</guid><author>tj310</author><pubDate>Mon, 27 Dec 2021 11:31:42 +0800</pubDate><description><![CDATA[//假设你正在爬楼梯。需要 n 阶你才能到达楼顶。每次你可以爬 1 或 2 个台阶。你有多少种不同的方法可以爬到楼顶呢？
// 假设n = 1  O==[===========&gt; 1种          0 1            0
// 假设n = 2  O==[===========&gt; 1+1 2 2种    1 2            1
// 假设n = 3  O==[===========&gt; 1+1+1 2+1 1+2  3种 1 3      2
// 假设n = 4  ]]></description><category></category></item><item><title><![CDATA[leetCode - 算术平方根]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122131469</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122131469</guid><author>tj310</author><pubDate>Fri, 24 Dec 2021 16:44:08 +0800</pubDate><description><![CDATA[function mySqrt(x: number): number {
    // if (x === 0) return 0
    // if(x === 1)  return 1
    // for (let i: number = 1; i &lt;= x / 2; i++) {
    //     if (i * i &lt;= x &amp;&amp; x &lt; (i + 1) * (i + 1)) {
    //         return i
    //     }
   ]]></description><category></category></item><item><title><![CDATA[leetCode - 二进制求和]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122129417</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122129417</guid><author>tj310</author><pubDate>Fri, 24 Dec 2021 15:35:17 +0800</pubDate><description><![CDATA[function addBinary(a: string, b: string): string {
  // 解法会溢出
  // const la = parseInt(a, 2)
  // const lb = parseInt(b, 2)
  // const total = (la + lb).toString(2)
  // return total
    let l1: string = a.length &gt;= b.length ? a : b
    let l2: string =]]></description><category></category></item><item><title><![CDATA[leetCode - 给定一个由 整数 组成的 非空 数组所表示的非负整数，在该数的基础上加一。]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122059950</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122059950</guid><author>tj310</author><pubDate>Tue, 21 Dec 2021 13:25:35 +0800</pubDate><description><![CDATA[// 给定一个由 整数 组成的 非空 数组所表示的非负整数，在该数的基础上加一。
function plusOne(digits) {
  for (let i = digits.length - 1; i &gt;= 0; i--) {
    if (digits[i] !== 9) {
      digits[i] += 1
      for (let j = i + 1; j &lt; digits.length; j++) {
        digits[j] = 0
      }
   ]]></description><category></category></item><item><title><![CDATA[leetCode - 最后一个单词的长度]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122046728</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122046728</guid><author>tj310</author><pubDate>Mon, 20 Dec 2021 17:47:00 +0800</pubDate><description><![CDATA[// 给你一个字符串 s，由若干单词组成，单词前后用一些空格字符隔开。返回字符串中最后一个单词的长度。
function lengthOfLastWord(s: string): number {
      return s.trim().split(' ')[s.trim().split(' ').length - 1].length
};


...]]></description><category></category></item><item><title><![CDATA[leetCode - 最大子数组和]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122045640</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122045640</guid><author>tj310</author><pubDate>Mon, 20 Dec 2021 17:12:05 +0800</pubDate><description><![CDATA[function maxSubArray(nums: number[]): number {
    if (nums.length === 1) return nums[0]

    let max_end: number = nums[0]
    let max_current: number = nums[0]
    for (let i: number = 1; i &lt; nums.length; i++) {
    	// 拿到第一个最大字串，就是nums[0]和nums[1]的和来做]]></description><category></category></item><item><title><![CDATA[leetCode - 搜索插入位置]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122039855</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122039855</guid><author>tj310</author><pubDate>Mon, 20 Dec 2021 13:51:55 +0800</pubDate><description><![CDATA[if (!nums.length) return 0
    let i: number = 0
    
    while (i &lt; nums.length) {
    
        if (nums[i] === target) return i


        if (nums[i] &gt; target) return i


        if (target &gt; nums[nums.length - 1]) return nums.length

        i+]]></description><category></category></item><item><title><![CDATA[leetCode - 移除数组中的指定元素]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122039363</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122039363</guid><author>tj310</author><pubDate>Mon, 20 Dec 2021 13:29:14 +0800</pubDate><description><![CDATA[function removeElement(nums:nums[], val:numer):numer {
  if (nums.length === 0) {
    return 0
  }
  let loop:numer = 0
  while (loop &lt; nums.length) {
    if (nums[loop] === val) {
      nums.splice(loop, 1)
    } else {
      loop++
    }
  }
  return ]]></description><category></category></item><item><title><![CDATA[leetCode -实现一个strStr(),返回一个字符串在另一个字符串中出现的位置]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/122039263</link><guid>https://blog.youkuaiyun.com/tj310/article/details/122039263</guid><author>tj310</author><pubDate>Mon, 20 Dec 2021 13:20:29 +0800</pubDate><description><![CDATA[function strStr(haystack, needle) {
  if (needle === '') return 0

  // js已有轮子
  // return haystack.indexOf(needle)

  // 相当于自己实现一个indexOf方法
  for (let i = 0; i &lt; haystack.length; i++) {
    if (haystack[i] === needle[0]) {
      if (haystack.slice(i, i]]></description><category></category></item><item><title><![CDATA[leetCode - 有效的括号]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/121825611</link><guid>https://blog.youkuaiyun.com/tj310/article/details/121825611</guid><author>tj310</author><pubDate>Thu, 09 Dec 2021 15:27:29 +0800</pubDate><description><![CDATA[说实话这个题还是觉得有问题，看了官方思路写出来了，
function isValid(s: string): boolean {
	// 先判断字符串的length 不为偶数返回false
	if (s.length % 2 !== 0) return false
	const strMap = new Map([
		[']', '['],
		[')', '('],
		['}', '{'],
	])
	const stk: string[] = []
	for (let i of s) {
		if ]]></description><category></category></item><item><title><![CDATA[couldn‘t find the plugin “eslint-plugin-jsdoc“. This can happen for a couple different reasons]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/121498095</link><guid>https://blog.youkuaiyun.com/tj310/article/details/121498095</guid><author>tj310</author><pubDate>Tue, 23 Nov 2021 17:24:42 +0800</pubDate><description><![CDATA[egg在做单元测试的时候报错，找不到eslint-plugin-jsdoc这个包
执行 npm ls eslint-plugin-jsdoc，查看依赖

这里eslint-config-egg@7.5.1依赖于它，找不到我们就装一下它
npm i eslint-plugin-jsdoc -D

重新测试

]]></description><category></category></item><item><title><![CDATA[leetCode -- 最长公共前缀]]></title><link>https://blog.youkuaiyun.com/tj310/article/details/121425922</link><guid>https://blog.youkuaiyun.com/tj310/article/details/121425922</guid><author>tj310</author><pubDate>Fri, 19 Nov 2021 16:33:08 +0800</pubDate><description><![CDATA[没有想到什么好的办法  就是直接暴力循环，先找到最短子串，在找子串
function longestCommonPrefix(strs: string[]): string {
	let focu:string = ''
	let str:string = strs[0]


	if (!strs.length) return focu

    // 先找最短子串
	for (let i = 1; i &lt; strs.length; i++) {
		str = strs[i].length &lt;]]></description><category></category></item></channel></rss>