<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[yan456321的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/yan456321</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; yan456321]]></copyright><item><title><![CDATA[黑马头条-文章审核]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/144645879</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/144645879</guid><author>yan456321</author><pubDate>Sun, 22 Dec 2024 14:16:19 +0800</pubDate><description><![CDATA[其核心思想是：使用41bit作为毫秒数，10bit作为机器的ID（5个bit是数据中心，5个bit的机器ID），12bit作为毫秒内的流水号（意味着每个节点在每毫秒可以产生 4096 个 ID），最后还有一个符号位，永远是0。如果数据库中该表选用ID自增策略，则可能产生重复的ID，此时应该使用分布式ID生成策略来生成ID。文章端相关的表都使用雪花算法生成id,包括ap_article、 ap_article_config、 ap_article_content。1 自媒体端发布文章后，开始审核文章。]]></description><category></category></item><item><title><![CDATA[Java HashMap中Map.entry原理]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/143807300</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/143807300</guid><author>yan456321</author><pubDate>Fri, 15 Nov 2024 20:46:59 +0800</pubDate><description><![CDATA[所以Entry的主要作用就是获取Map中的键和值，使用场景就是便利整个映射，获取相应的值。中的一个键值对（key-value pair）。结构中每个元素的基本表示形式。是一个静态内部接口，定义在。通常用于遍历整个映射（例如。），以便同时获取键和值。]]></description><category></category></item><item><title><![CDATA[Mybaits底层原理]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/143194076</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/143194076</guid><author>yan456321</author><pubDate>Wed, 23 Oct 2024 21:24:40 +0800</pubDate><description><![CDATA[MyBatis的底层操作封装了JDBC的API，MyBatis的工作原理以及核心流程与JDBC的使用步骤一脉相承，MyBatis的核心对象（SqlSession，Executor）与JDBC的核心对象（Connection，Statement）相互对应。]]></description><category></category></item><item><title><![CDATA[BaseContext的使用]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/143171133</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/143171133</guid><author>yan456321</author><pubDate>Tue, 22 Oct 2024 23:20:29 +0800</pubDate><description><![CDATA[在http的一次请求中，一些特定情境下，我们无法通过request.getSession.getAttribute获取当前所登录用户的id，此时若需要获取当前所登录用户的id，我们可以采用ThreadLocal来解决问题，首先要明确一个问题就是，ThreadLocal并不是一个Thread，而是Thread的局部变量。当使用ThreadLocal维护变量时,ThreadLocal为每个使用该变量的线程提供独立的变量副本，所以每一个线程都可以独立地改变自己的副本，而不会影响其它线程所对应的副本。]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122869794</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122869794</guid><author>yan456321</author><pubDate>Thu, 10 Feb 2022 21:33:33 +0800</pubDate><description><![CDATA[Background
Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his customer has build his giant steel crane to the place where ]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122825386</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122825386</guid><author>yan456321</author><pubDate>Tue, 08 Feb 2022 15:45:39 +0800</pubDate><description><![CDATA[A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each person has a dif]]></description><category></category></item><item><title><![CDATA[English translat]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122825361</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122825361</guid><author>yan456321</author><pubDate>Tue, 08 Feb 2022 15:44:34 +0800</pubDate><description><![CDATA[We can number binary trees using the following scheme:
The empty tree is numbered 0.
The single-node tree is numbered 1.
All binary trees having m nodes have numbers less than all those having m+1 nodes.
Any binary tree having m nodes with left and right s]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122801398</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122801398</guid><author>yan456321</author><pubDate>Sun, 06 Feb 2022 20:37:35 +0800</pubDate><description><![CDATA["The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in World War II. Fortunately old Brumbaugh from research knew Klein's secrets ]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122658293</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122658293</guid><author>yan456321</author><pubDate>Sun, 23 Jan 2022 22:12:54 +0800</pubDate><description><![CDATA[Reverse Polish notation (or just RPN) by analogy with the related Polish notation, a prefix notation introduced in 1920 by the Polish mathematician Jan Łukasiewicz, is a mathematical notation wherein every operator follows all of its operands. It is also k]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122618673</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122618673</guid><author>yan456321</author><pubDate>Fri, 21 Jan 2022 12:14:59 +0800</pubDate><description><![CDATA[Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from the real silver dollars. The counterfeit coin has a different ]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122606774</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122606774</guid><author>yan456321</author><pubDate>Thu, 20 Jan 2022 17:44:09 +0800</pubDate><description><![CDATA[Bessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants were siblings, indistinguishable from one another. She also realized the sometimes only one ant would go for food, som]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122582939</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122582939</guid><author>yan456321</author><pubDate>Wed, 19 Jan 2022 15:55:21 +0800</pubDate><description><![CDATA[OpenJudge - 755:Flip Game

Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white side up. Each ro]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122562723</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122562723</guid><author>yan456321</author><pubDate>Wed, 19 Jan 2022 15:52:02 +0800</pubDate><description><![CDATA[The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in World War II. Fortunately old Brumbaugh from research knew Klein's secrets a]]></description><category></category></item><item><title><![CDATA[English translate]]></title><link>https://blog.youkuaiyun.com/yan456321/article/details/122546732</link><guid>https://blog.youkuaiyun.com/yan456321/article/details/122546732</guid><author>yan456321</author><pubDate>Mon, 17 Jan 2022 19:43:47 +0800</pubDate><description><![CDATA[We can number binary trees using the following scheme:
The empty tree is numbered 0.
The single-node tree is numbered 1.
All binary trees having m nodes have numbers less than all those having m+1 nodes.
Any binary tree having m nodes with left and right s]]></description><category></category></item></channel></rss>