<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zhangjun62的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/zhangjun62</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; zhangjun62]]></copyright><item><title><![CDATA[字段脱敏统一框架]]></title><link>https://blog.csdn.net/zhangjun62/article/details/117356470</link><guid>https://blog.csdn.net/zhangjun62/article/details/117356470</guid><author>zhangjun62</author><pubDate>Fri, 28 May 2021 13:32:09 +0800</pubDate><description><![CDATA[方案一：对需要脱敏的接口统一使用切面进行处理，需要找到接口脱敏字段，根据字段和枚举维护的规则进行脱敏处理



优点：可以控制哪个接口哪个方法进行脱敏

缺点：找到需要脱敏属性字段需要递归遍历较为复杂，对象是l数组和对象组合、同名属性字段多以及层数深都会提高复杂度



方案二：利用fastjson序列化过滤器+自定义注解实现，在需要脱敏字段打上注解，然后在自定义fastjson序列化过滤器中对打上自定义注解属性进行脱敏，脱敏规则也维护在枚举中



优点：通用性强、实现简单

缺点：对于所有接口和字...]]></description><category></category></item><item><title><![CDATA[消息中间件学习]]></title><link>https://blog.csdn.net/zhangjun62/article/details/102779511</link><guid>https://blog.csdn.net/zhangjun62/article/details/102779511</guid><author>zhangjun62</author><pubDate>Mon, 28 Oct 2019 16:00:23 +0800</pubDate><description><![CDATA[消息中间件概念

   利用高效可靠的消息传递机制进行平台无关的数据交流，并基于数据通信进行分布式系统的集成，通过提供消息传递和消息排队模型，它可以在分布式环境下扩展进程间的通信。



消息中间件应用场景

   跨系统数据传递、高并发流量削峰、数据异步处理...等等

常用消息中间件

   ActiveMQ、RabbitMQ、Kafka、RocketMQ

消息中间件...]]></description><category></category></item><item><title><![CDATA[树莓派3b+ 环境搭建]]></title><link>https://blog.csdn.net/zhangjun62/article/details/80517176</link><guid>https://blog.csdn.net/zhangjun62/article/details/80517176</guid><author>zhangjun62</author><pubDate>Wed, 09 Oct 2019 13:05:32 +0800</pubDate><description><![CDATA[我的树莓派3b+ 没有买HDMI 屏，利用网线与电脑主机相连操纵树莓派。如果买回来接上电，电源灯在闪，表明板子有问题，赶快换。

  第一步，给SD卡烧系统。3b+需要的系统要求比较新，不然插上SD卡，网口灯也不会亮，系统也不会启动，版本是2018-03-13-raspbian-stretch.img 和2018-04-18-raspbian-stretch.img就可以，官网htt...]]></description><category></category></item><item><title><![CDATA[缓存学习]]></title><link>https://blog.csdn.net/zhangjun62/article/details/100712090</link><guid>https://blog.csdn.net/zhangjun62/article/details/100712090</guid><author>zhangjun62</author><pubDate>Tue, 10 Sep 2019 21:30:31 +0800</pubDate><description><![CDATA[为什么使用缓存？

   缓存能够提高应用程序性能，降低数据库成本，减少后端负载，增加可预测性能，消除数据库热点，提高读取吞吐量。

   在Java应用中，对于访问频率高，更新少的数据，通常的方案是将这类数据加入缓存中。相对从数据库中读取来说，读取缓存效率会有效提升。

   在集群环境下，常用分布式缓存有Redis、Memcached等。但在某些业务场景下，可能不需要去...]]></description><category></category></item><item><title><![CDATA[LeetCode146 LRU Cache]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99685940</link><guid>https://blog.csdn.net/zhangjun62/article/details/99685940</guid><author>zhangjun62</author><pubDate>Fri, 16 Aug 2019 21:38:21 +0800</pubDate><description><![CDATA[题目：

   Design and implement a data structure forLeast Recently Used (LRU) cache. It should support the following operations:getandput.

   get(key)- Get the value (will always be positiv...]]></description><category></category></item><item><title><![CDATA[LeetCode233 Number of Digit One]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99670836</link><guid>https://blog.csdn.net/zhangjun62/article/details/99670836</guid><author>zhangjun62</author><pubDate>Fri, 16 Aug 2019 10:22:34 +0800</pubDate><description><![CDATA[题目：

   Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.

   Example:

   Input: 13

   Output: 6

   Explanati...]]></description><category></category></item><item><title><![CDATA[LeetCode25 Reverse Nodes in k-Group]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99480764</link><guid>https://blog.csdn.net/zhangjun62/article/details/99480764</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 21:51:02 +0800</pubDate><description><![CDATA[题目：

   Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.

   kis a positive integer and is less than or equal to the length of the linked list...]]></description><category></category></item><item><title><![CDATA[LeetCode24 Swap Nodes in Pairs]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99450795</link><guid>https://blog.csdn.net/zhangjun62/article/details/99450795</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 17:08:34 +0800</pubDate><description><![CDATA[题目：

   Given alinked list, swap every two adjacent nodes and return its head.

   You maynotmodify the values in the list's nodes, only nodes itself may be changed.

   Example:

  ...]]></description><category></category></item><item><title><![CDATA[LeetCode21 Merge Two Sorted Lists]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99450293</link><guid>https://blog.csdn.net/zhangjun62/article/details/99450293</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 17:04:05 +0800</pubDate><description><![CDATA[题目：

   Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

   Example:

   Input: 1-&gt;2-&gt;4,...]]></description><category></category></item><item><title><![CDATA[LeetCode82 Remove Duplicates from Sorted List II]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99447103</link><guid>https://blog.csdn.net/zhangjun62/article/details/99447103</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 16:40:14 +0800</pubDate><description><![CDATA[题目：

   Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.

   Example 1:

   Input: 1-&gt;2-&gt;3-&gt;3-&gt;4-...]]></description><category></category></item><item><title><![CDATA[LeetCode203]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99441857</link><guid>https://blog.csdn.net/zhangjun62/article/details/99441857</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 15:51:56 +0800</pubDate><description><![CDATA[题目：

   Remove all elements from a linked list of integers that have valueval.

   Example:

   Input: 1-&gt;2-&gt;6-&gt;3-&gt;4-&gt;5-&gt;6, val = 6

   Output: 1-&gt;2-&gt;3-&gt;4-&...]]></description><category></category></item><item><title><![CDATA[LeetCode445 Add Two Numbers II]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99441337</link><guid>https://blog.csdn.net/zhangjun62/article/details/99441337</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 15:43:29 +0800</pubDate><description><![CDATA[题目：

   You are given twonon-emptylinked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers ...]]></description><category></category></item><item><title><![CDATA[LeetCode2 Add Two Numbers]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99431458</link><guid>https://blog.csdn.net/zhangjun62/article/details/99431458</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 14:19:57 +0800</pubDate><description><![CDATA[题目：

   You are given twonon-emptylinked lists representing two non-negative integers. The digits are stored inreverse orderand each of their nodes contain a single digit. Add the two numbers ...]]></description><category></category></item><item><title><![CDATA[LeetCode328 Odd Even Linked List]]></title><link>https://blog.csdn.net/zhangjun62/article/details/99428580</link><guid>https://blog.csdn.net/zhangjun62/article/details/99428580</guid><author>zhangjun62</author><pubDate>Tue, 13 Aug 2019 14:00:28 +0800</pubDate><description><![CDATA[题目：

   Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

   You shoul...]]></description><category></category></item><item><title><![CDATA[LeetCode86 Partition List]]></title><link>https://blog.csdn.net/zhangjun62/article/details/98754889</link><guid>https://blog.csdn.net/zhangjun62/article/details/98754889</guid><author>zhangjun62</author><pubDate>Wed, 07 Aug 2019 16:04:19 +0800</pubDate><description><![CDATA[题目：

   Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the original relative order of the nodes in ...]]></description><category></category></item><item><title><![CDATA[LeetCode83 Remove Duplicates from Sorted List]]></title><link>https://blog.csdn.net/zhangjun62/article/details/98743305</link><guid>https://blog.csdn.net/zhangjun62/article/details/98743305</guid><author>zhangjun62</author><pubDate>Wed, 07 Aug 2019 13:59:14 +0800</pubDate><description><![CDATA[题目：

   Given a sorted linked list, delete all duplicates such that each element appear onlyonce.

   Example 1:

   Input: 1-&gt;1-&gt;2

   Output: 1-&gt;2

   Example 2:

  ...]]></description><category></category></item><item><title><![CDATA[LeetCode92 Reverse Linked List II]]></title><link>https://blog.csdn.net/zhangjun62/article/details/98612413</link><guid>https://blog.csdn.net/zhangjun62/article/details/98612413</guid><author>zhangjun62</author><pubDate>Tue, 06 Aug 2019 14:02:48 +0800</pubDate><description><![CDATA[题目：

   Reverse a linked list from positionmton. Do it in one-pass.

   Note:1 ≤m≤n≤ length of list.

   Example:

   Input: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL, m = 2, n = 4

...]]></description><category></category></item><item><title><![CDATA[Git SSH免密登陆设置]]></title><link>https://blog.csdn.net/zhangjun62/article/details/98469994</link><guid>https://blog.csdn.net/zhangjun62/article/details/98469994</guid><author>zhangjun62</author><pubDate>Sun, 04 Aug 2019 16:06:32 +0800</pubDate><description><![CDATA[Windows 安装完Git后需要设置ssh免密登陆

   打开Git Bash终端



   输入命令生成密钥









此时默认密钥保存路径会有私钥和公钥两个文件



   然后登陆到GitHub，打开settings，然后找到SSH keys and GPG keys，点击New SSH Key



   打开生成的id_rsa...]]></description><category></category></item><item><title><![CDATA[CentOS安装Nginx]]></title><link>https://blog.csdn.net/zhangjun62/article/details/97649673</link><guid>https://blog.csdn.net/zhangjun62/article/details/97649673</guid><author>zhangjun62</author><pubDate>Mon, 29 Jul 2019 17:07:09 +0800</pubDate><description><![CDATA[Nginx是一个轻量级的、高性能的、基于Http的、反向代理服务器，同时还是一个电子邮件服务器。

   官网地址：nginx.org/

   下载地址：http://nginx.org/en/download.html

   需要下载稳定版本stable version

   在CentOS下直接下载

   wget http://n...]]></description><category></category></item><item><title><![CDATA[LeetCode49 Group Anagrams]]></title><link>https://blog.csdn.net/zhangjun62/article/details/97621266</link><guid>https://blog.csdn.net/zhangjun62/article/details/97621266</guid><author>zhangjun62</author><pubDate>Sun, 28 Jul 2019 23:29:58 +0800</pubDate><description><![CDATA[题目：

   Given an array of strings, group anagrams together.

   Example:

   Input:

   ["eat", "tea", "tan", "ate", "nat", "bat"],

   Output:


   [
     ["ate","eat","tea"],
   ...]]></description><category></category></item></channel></rss>