<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lamycies的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lamycies</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lamycies]]></copyright><item><title><![CDATA[DIVE INTO DEEP LEARNING学习笔记2]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/136248816</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/136248816</guid><author>lamycies</author><pubDate>Fri, 01 Mar 2024 15:37:05 +0800</pubDate><description><![CDATA[Xavier初始化表明，对于每一层，输出的方差不受输入数量的影响，任何梯度的方差不受输出数量的影响。反向传播按相反的顺序（从输出层到输入层）计算和存储神经网络的中间变量和参数的梯度。激活函数是一种添加到人工神经网络中的函数，旨在帮助网络学习数据中的复杂模式。常见的激活函数如ReLU函数、sigmoid函数和tanh函数都是非线性的，从而使得神经网络逼近其他的任何非线性函数，校准模型。暂退法在前向传播过程中，计算每一内部层的同时丢弃一些神经元，可以避免过拟合，它通常与控制权重向量的维数和大小结合使用的。]]></description><category></category></item><item><title><![CDATA[DIVE INTO DEEP LEARNING学习笔记1]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/136220762</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/136220762</guid><author>lamycies</author><pubDate>Wed, 21 Feb 2024 21:54:25 +0800</pubDate><description><![CDATA[在建模的过程中，我们需要一种模型质量的度量方式和一种能够更新模型以提高模型质量的方法。在高斯噪声的假设下，最小化均方误差等价于对线性模型的极大似然估计（即最小目标函数和执行极大似然估计等价）。线性回归模型也是一个简单的神经网络，是单层网络结构，这一单层被称为全连接层。训练softmax回归循环模型与训练线性回归模型非常相似：先读取数据，再定义模型和损失函数，然后使用优化算法训练模型。交叉熵：一个衡量两个概率分布之间差异的很好的度量，它测量给定模型编码数据所需的比特数。信息熵：系统有序化的一个度量。]]></description><category></category></item><item><title><![CDATA[力扣169.多数元素]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/123696044</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/123696044</guid><author>lamycies</author><pubDate>Wed, 23 Mar 2022 20:55:19 +0800</pubDate><description><![CDATA[1.

将数组中的元素分为两类：多数元素和非多数元素。将多数元素与非多数元素逐一抵消，最后剩下的就是多数元素了。


int majorityElement(int* nums, int numsSize){
    int snum=nums[0],nums1=1;
    for(int i=1;i&lt;numsSize;i++){
        if(nums[i]!=snum){
            if(nums1==0) snum=nums[i],nums1++;
           ]]></description><category></category></item><item><title><![CDATA[力扣141.环形链表]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/123642662</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/123642662</guid><author>lamycies</author><pubDate>Mon, 21 Mar 2022 18:44:52 +0800</pubDate><description><![CDATA[设置两个指针，一个fast一个slow

slow赋值head，fast赋值head-&gt;next

之后一直以slow指向next,fast指向next-&gt;next进行运算

如果再fast跑完前，fast和slow相遇了，则说明存在环






/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
bool..]]></description><category></category></item><item><title><![CDATA[力扣101对称二叉树]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/123598796</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/123598796</guid><author>lamycies</author><pubDate>Sat, 19 Mar 2022 17:29:02 +0800</pubDate><description><![CDATA[递归


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */


bool isSym(struct TreeNode* p, struct TreeNode* q){
    if(!p &amp;&amp; !q)
        return true;
 ]]></description><category></category></item><item><title><![CDATA[力扣66.加一]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/123585259</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/123585259</guid><author>lamycies</author><pubDate>Fri, 18 Mar 2022 21:43:50 +0800</pubDate><description><![CDATA[取flag默认初值为一，之后一直通过/10的方式来对前一位数进行进位


/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* plusOne(int* digits, int digitsSize, int* returnSize){
    int flag=1;
    for(int i=digitsSize-1;i&gt;=0;i--){
        digits[i]=di]]></description><category></category></item><item><title><![CDATA[力扣58.最后一个单词的长度]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/123572315</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/123572315</guid><author>lamycies</author><pubDate>Fri, 18 Mar 2022 13:20:52 +0800</pubDate><description><![CDATA[最开始考虑从最后一个往前找，找到第一个空来确定单词的起始位置

代码：


int lengthOfLastWord(char * s){
    int count=0;
    bool flag=false;
    for(int i=strlen(s)-1;i&gt;=0;i--){
        if(s[i]==' ')
            break;
        else{
            count++;
        }
    }
    return count]]></description><category></category></item><item><title><![CDATA[力扣208.实现Trie（前缀树）]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/122759360</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/122759360</guid><author>lamycies</author><pubDate>Mon, 31 Jan 2022 13:23:03 +0800</pubDate><description><![CDATA[图中蓝色表示在该路径中有单词以它作为结尾


typedef struct {
    int isEnd;
    struct trie* next[26];
} Trie;


Trie* trieCreate() {
    Trie *root;
    root = (Trie *)malloc(sizeof(Trie) * 1 );
    memset(root, 0, sizeof(*root));
    root-&gt;isEnd = 0;
    return root;
}
..]]></description><category></category></item><item><title><![CDATA[力扣133.克隆图]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/122724159</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/122724159</guid><author>lamycies</author><pubDate>Thu, 27 Jan 2022 21:49:37 +0800</pubDate><description><![CDATA[/**
 * Definition for a Node.
 * struct Node {
 *     int val;
 *     int numNeighbors;
 *     struct Node** neighbors;
 * };
 */

#define MAX_NODE_NUM 100
struct Node *cloneGraph(struct Node *s) 
{
    if (s == NULL) {
        return NULL;
    }
    stru.]]></description><category></category></item><item><title><![CDATA[力扣632.最小区间]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/122645392</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/122645392</guid><author>lamycies</author><pubDate>Sat, 22 Jan 2022 22:51:44 +0800</pubDate><description><![CDATA[滑动窗口，在所有出现的值中间移动，并且要去除重复出现的数


/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
#define MAX_NUMS 180000

int compare(const void* a, const void* b)
{
    return *(int*)a - *(int*)b;
}

// 获得最大值和最小值，并且得到所有出现的数
void getRange(i]]></description><category></category></item><item><title><![CDATA[力扣218.天际线问题]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/122568622</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/122568622</guid><author>lamycies</author><pubDate>Wed, 19 Jan 2022 13:24:26 +0800</pubDate><description><![CDATA[用line sweep



输入(x1,x2,y),左上角顶点用(x1,-y)表示，右上角顶点用(x2,y)表示

如示例，输入：

[2,9,10],[3,7,15],[5,12,12],[15,20,10],[19,24,8]

及每个转折点为：

[2,10],[9,10],[3,15],[7,15],[5,12],[12,12],[15,10],[20,10],[19,8],[24,8]

按上述方法表示后并排序，变为：

[2,-10],[3,-15],[5,-12],[7,15],[9,10]]]></description><category></category></item><item><title><![CDATA[力扣1226.哲学家进餐]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/122508483</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/122508483</guid><author>lamycies</author><pubDate>Tue, 18 Jan 2022 19:25:16 +0800</pubDate><description><![CDATA[死锁产生的四个必要条件：

（1）互斥条件：一个资源每次只能被一个进程使用。
（2）占有且等待：进程已经占有了至少一个资源，同时请求新资源而被阻塞时，对已获得的资源保持不放。
（3）不可强行占有:进程已获得的资源，在末使用完之前，不能强行剥夺。
（4）循环等待条件:若干进程之间形成一种头尾相接的循环等待资源关系。

设第i个哲学家，他左边的筷子为i，右边为（i+1）%5
...]]></description><category></category></item><item><title><![CDATA[力扣13. 罗马数字转整数]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/119845661</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/119845661</guid><author>lamycies</author><pubDate>Sat, 15 Jan 2022 12:21:39 +0800</pubDate><description><![CDATA[直接暴力




int romanToInt(char * s){
    int sum=0,len;
    len=strlen(s);
    for(int i=0;i&lt;len;i++)
    {
        if(s[i]=='M')
        sum=sum+1000;
        else if(s[i]=='C'&amp;&amp;(s[i+1]!='M'&amp;&amp;s[i+1]!='D'))
        sum=sum+100;
        els]]></description><category></category></item><item><title><![CDATA[力扣221. 最大正方形]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/119919351</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/119919351</guid><author>lamycies</author><pubDate>Sat, 28 Aug 2021 21:23:58 +0800</pubDate><description><![CDATA[/**
 * dp表示最大正方形边长，dp[i][j] = MIN(dp[i-1][j-1], dp[i][j-1], dp[i-1][j]);
 */
#define MIN(a, b) ((a) &lt; (b) ? (a) : (b))
#define MAX(a, b) ((a) &gt; (b) ? (a) : (b))

int maximalSquare(char** matrix, int matrixSize, int* matrixColSize){
    int i, j, max.]]></description><category></category></item><item><title><![CDATA[力扣417. 太平洋大西洋水流问题]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/119919241</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/119919241</guid><author>lamycies</author><pubDate>Wed, 25 Aug 2021 20:51:02 +0800</pubDate><description><![CDATA[/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
int m,n;
int axis[5]={-1,0,1,0.]]></description><category></category></item><item><title><![CDATA[力扣94. 二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/119832606</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/119832606</guid><author>lamycies</author><pubDate>Fri, 20 Aug 2021 22:57:27 +0800</pubDate><description><![CDATA[中序遍历：A-B-C-D-E-F-G-H-I-J

递归


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */


/**
 * Note: The returned array must be malloced, assume caller calls ...]]></description><category></category></item><item><title><![CDATA[力扣70爬楼梯]]></title><link>https://blog.youkuaiyun.com/lamycies/article/details/119832520</link><guid>https://blog.youkuaiyun.com/lamycies/article/details/119832520</guid><author>lamycies</author><pubDate>Fri, 20 Aug 2021 22:28:14 +0800</pubDate><description><![CDATA[​
int c(int n)

{

int p=0,q=0,r=1;

for(int i=1;i&lt;=n;i++)

{

p=q; q=r; r=p+q;

}

return r; }

​


...]]></description><category></category></item></channel></rss>