<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[serena_t的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/serena_t</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; serena_t]]></copyright><item><title><![CDATA[java 入门保姆级教程]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/125595533</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/125595533</guid><author>serena_t</author><pubDate>Mon, 04 Jul 2022 10:46:12 +0800</pubDate><description><![CDATA[java 入门保姆级教程]]></description><category></category></item><item><title><![CDATA[条件生成对抗网络（CGAN）]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/103656815</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/103656815</guid><author>serena_t</author><pubDate>Sun, 22 Dec 2019 20:48:44 +0800</pubDate><description><![CDATA[之前一直搞不清二者的区别，今天研究了一下，理解如下：
（1）生成对抗网络–GAN
众所周知的生成对抗网络–GAN，由生成器和判别器构成，二者互相博弈，构成对抗。
损失函数为：

（2）条件生成对抗网络–CGAN
在生成器和判别器的输入中都加入了标签，损失函数为：


...]]></description><category></category></item><item><title><![CDATA[图像语义理解]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/103471795</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/103471795</guid><author>serena_t</author><pubDate>Tue, 10 Dec 2019 10:58:29 +0800</pubDate><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 1.没有图像的理解，就不要谈目标的检测、分类和识别。理解才是硬道理；
&nbsp;&nbsp;&nbsp;2.不在于图像理解模型是否与人类的认知过程一致，关键是要有效；
&nbsp;&nbsp;&nbsp;3.图像是最自然的自然语言，图像理解可以借鉴自然语言处理中的方法。
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&...]]></description><category></category></item><item><title><![CDATA[Leecode #33  Search in Rotated Sorted Array]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/101052756</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/101052756</guid><author>serena_t</author><pubDate>Fri, 20 Sep 2019 10:29:46 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第三十三题，题目为：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target va...]]></description><category></category></item><item><title><![CDATA[TCP的三次握手与四次挥手（详解+动图）]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/100109377</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/100109377</guid><author>serena_t</author><pubDate>Tue, 27 Aug 2019 21:58:49 +0800</pubDate><description><![CDATA[版权声明：本文为博主原创文章，遵循 CC 4.0 by-sa 版权协议，转载请附上原文出处链接和本声明。 
               
             ...]]></description><category></category></item><item><title><![CDATA[哈希表（散列表）原理详解]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/100029940</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/100029940</guid><author>serena_t</author><pubDate>Fri, 23 Aug 2019 08:39:35 +0800</pubDate><description><![CDATA[什么是哈希表？
&nbsp;&nbsp;&nbsp;哈希表（Hash table，也叫散列表），是根据关键码值(Key value)而直接进行访问的数据结构。也就是说，它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。这个映射函数叫做散列函数，存放记录的数组叫做散列表。
记录的存储位置=f(关键字)
这里的对应关系f称为散列函数，又称为哈希（Hash函数），采用散列技术将记录存储...]]></description><category></category></item><item><title><![CDATA[算法之二叉树各种遍历]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/99706650</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/99706650</guid><author>serena_t</author><pubDate>Sun, 18 Aug 2019 17:02:42 +0800</pubDate><description><![CDATA[版权声明：本文为博主原创文章，遵循 CC 4.0 by-sa 版权协议，转载请附上原文出处链接和本声明。 
               
             ...]]></description><category></category></item><item><title><![CDATA[c语言链表详解]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/95591755</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/95591755</guid><author>serena_t</author><pubDate>Fri, 12 Jul 2019 09:53:57 +0800</pubDate><description><![CDATA[原                c语言链表详解（超详细）
            
            
                
                                                                                   ...]]></description><category></category></item><item><title><![CDATA[看图理解单链表的反转]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/95591204</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/95591204</guid><author>serena_t</author><pubDate>Fri, 12 Jul 2019 09:49:22 +0800</pubDate><description><![CDATA[原                看图理解单链表的反转
            
            
                
                                                                                     ...]]></description><category></category></item><item><title><![CDATA[单向链表反转]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/95461007</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/95461007</guid><author>serena_t</author><pubDate>Thu, 11 Jul 2019 11:39:59 +0800</pubDate><description><![CDATA[今天遇到单向链表的反转的问题，于是静下心来好好想了一番。 
解题思路如下图：
假设当前创建好的链表如下：

首先让头节点与第一个元素节...]]></description><category></category></item><item><title><![CDATA[LaTeX里处理不浮动的图形和表格的办法]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/95453558</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/95453558</guid><author>serena_t</author><pubDate>Thu, 11 Jul 2019 10:23:26 +0800</pubDate><description><![CDATA[众所周知，LaTeX里 面处理图形和表格的浮动体历来是最麻烦的问题之一，原因是即使使用了[h]选项，浮动体还是会乱跑，但如果去掉
\begin{figure}
\end{figure}
\begin{figure}\end{figure}
来一个裸的\includegraphics又不能结合\caption命令加标题。这个问题其实在著名的"LaTeX2e及常 用宏包使用指南"里的8.7节有介绍，但...]]></description><category></category></item><item><title><![CDATA[Leecode #34   Find First and Last Position of Element in Sorted Array；（未完待续）]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/95030729</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/95030729</guid><author>serena_t</author><pubDate>Sun, 07 Jul 2019 21:59:10 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第三十一题，题目为：
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
If such arrangement is not possible, it must rearrange it...]]></description><category></category></item><item><title><![CDATA[Leecode #30      Substring with Concatenation of All Words]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/94990711</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/94990711</guid><author>serena_t</author><pubDate>Sun, 07 Jul 2019 15:06:38 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第三十题，题目为：
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in ...]]></description><category></category></item><item><title><![CDATA[Leecode #29      Divide Two Integers]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/94590679</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/94590679</guid><author>serena_t</author><pubDate>Wed, 03 Jul 2019 21:43:27 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第二十九题，题目为：
Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.
Return the quotient after dividing dividend by divisor.
...]]></description><category></category></item><item><title><![CDATA[Leecode #28     Implement strStr()]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/94590324</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/94590324</guid><author>serena_t</author><pubDate>Wed, 03 Jul 2019 21:29:57 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第二十八题，题目为：
Implement strStr().
Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Example 1:
Input: haystack = “hello”, needle = “l...]]></description><category></category></item><item><title><![CDATA[Leecode #27    Remove Element]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/93628338</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/93628338</guid><author>serena_t</author><pubDate>Tue, 25 Jun 2019 16:35:14 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第二十七题，题目为：
Given an array nums and a value val, remove all instances of that value in-place and return the new length.
Do not allocate extra space for another array, you must do this by...]]></description><category></category></item><item><title><![CDATA[Leecode #26    Reverse Nodes in k-Group]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/93603356</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/93603356</guid><author>serena_t</author><pubDate>Tue, 25 Jun 2019 11:30:13 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第二十六题，题目为：
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.
Do not allocate extra space for another array, yo...]]></description><category></category></item><item><title><![CDATA[Leecode #25    Reverse Nodes in k-Group]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/93520786</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/93520786</guid><author>serena_t</author><pubDate>Mon, 24 Jun 2019 20:29:16 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第二十五题，题目为：
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
k is a positive integer and is less than or equal to the length of the linke...]]></description><category></category></item><item><title><![CDATA[Leecode #24    Swap Nodes in Pairs]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/93387014</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/93387014</guid><author>serena_t</author><pubDate>Sun, 23 Jun 2019 16:46:08 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第二十四题，题目为：
Given a linked list, swap every two adjacent nodes and return its head.
You may not modify the values in the list’s nodes, only nodes itself may be changed.
Example:
Given 1-...]]></description><category></category></item><item><title><![CDATA[Leecode #23    Merge k Sorted Lists]]></title><link>https://blog.youkuaiyun.com/serena_t/article/details/93229965</link><guid>https://blog.youkuaiyun.com/serena_t/article/details/93229965</guid><author>serena_t</author><pubDate>Fri, 21 Jun 2019 20:44:02 +0800</pubDate><description><![CDATA[一、 问题描述
Leecode第二十三题，题目为：
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
Example:
Input:
[
1-&gt;4-&gt;5,
1-&gt;3-&gt;4,
2-&gt;6
]
Output: 1-&gt;1-&...]]></description><category></category></item></channel></rss>