<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[nobugnoredwarn的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/nobugnoredwarn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; nobugnoredwarn]]></copyright><item><title><![CDATA[leetcode707 设计链表 （C语言实现）]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123695992</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123695992</guid><author>nobugnoredwarn</author><pubDate>Wed, 23 Mar 2022 20:51:46 +0800</pubDate><description><![CDATA[直接贴代码


typedef struct {
	int val;
	struct ListNode* next;
} ListNode;

typedef struct {
	int count;
	struct ListNode* head;
} MyLinkedList;

MyLinkedList* myLinkedListCreate() {
	MyLinkedList* MyLink = (MyLinkedList*)malloc(sizeof(MyLinkedList));
	MyLink-]]></description><category></category></item><item><title><![CDATA[leetcode 203. 移除链表元素 （C语言实现）]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123644336</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123644336</guid><author>nobugnoredwarn</author><pubDate>Mon, 21 Mar 2022 19:57:34 +0800</pubDate><description><![CDATA[就是很基本的删除链表中值为val的结点，这是一道简单题，然而我一开始却没有写对...


/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */

struct ListNode* removeElements(struct ListNode* head, int val) 
{
    struct ListNode* p =]]></description><category></category></item><item><title><![CDATA[leetcode27 移除元素 C语言实现]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123020128</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123020128</guid><author>nobugnoredwarn</author><pubDate>Sat, 19 Feb 2022 16:26:30 +0800</pubDate><description><![CDATA[开始看了公众号的快慢指针


int removeElement(int* nums, int numsSize, int val) 
{
	int a = 0;//快指针
	int b = 0;//慢指针
	for (a = 0, b = 0; a &lt; numsSize;)
	{
		if (nums[a] == val)
		{
			a++;
		}
		else
		{
			nums[b] = nums[a];
			a++;
			b++;
		}
	}
	return b;
}

后来看]]></description><category></category></item><item><title><![CDATA[leetcode31 下一个排列 C语言实现]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123019202</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123019202</guid><author>nobugnoredwarn</author><pubDate>Sat, 19 Feb 2022 15:39:30 +0800</pubDate><description><![CDATA[没见过的题型，看了题解很棒的题解之后 才会做，但也就写了一次就过了 没有debug ( •̀ ω •́ )y


void reverse(int* a, int s)
{
	for (int i = 0; i &lt; s / 2; i++)
	{
		int temp = a[i];
		a[i] = a[s - 1 - i];
		a[s - 1 - i] = temp;
	}
	return;
}
void nextPermutation(int* nums, int numsSize) 
{
	i]]></description><category></category></item><item><title><![CDATA[leetcode18 四数之和 C语言实现]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123006891</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123006891</guid><author>nobugnoredwarn</author><pubDate>Fri, 18 Feb 2022 16:47:44 +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().
 */
 //两个for循环 头 尾
int comp(const .]]></description><category></category></item><item><title><![CDATA[leetcode16 最接近的三数之和 C语言实现]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123004669</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/123004669</guid><author>nobugnoredwarn</author><pubDate>Fri, 18 Feb 2022 15:32:19 +0800</pubDate><description><![CDATA[写了一遍就过了，没有报错
虽然效率不算高 超过了50%
延续了leetcode15的双指针思想
int comp(const void* a, const void* b)
{
	return *(int*)a - *(int*)b;
}

int threeSumClosest(int* nums, int numsSize, int target) 
{
	qsort(nums, numsSize, sizeof(int), comp);
	int sum = 0;
	int t = 0;
	sum +]]></description><category></category></item><item><title><![CDATA[leetcode15 三数之和 C语言实现]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/122999969</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/122999969</guid><author>nobugnoredwarn</author><pubDate>Fri, 18 Feb 2022 11:54:02 +0800</pubDate><description><![CDATA[看到题目的标签有双指针，因为之前做过leetcode11，所以自然而然带入了那道题的想法。我最初的想法是：先排序（联想到了王道书上的一道题，也是先排序），然后最小的和最大的指针不动，移动在这两个数大小之间的数的指针，这种情况可能找到符合条件的三个数，也可能找不到，然后再移动左右边界的指针。感觉哪里怪怪的。
于是看了官方题解，之后的想法：第一个指针不动（一个for循环遍历所有数），第二个指针不动（一个for循环），第三个指针从后往前找符合条件的三个数，结果超时，其实这个想法并没有用到双指针的思想。
/**
 ]]></description><category></category></item><item><title><![CDATA[leetcode11]]></title><link>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/122992166</link><guid>https://blog.youkuaiyun.com/nobugnoredwarn/article/details/122992166</guid><author>nobugnoredwarn</author><pubDate>Thu, 17 Feb 2022 21:31:05 +0800</pubDate><description><![CDATA[之前没见过的双指针法（(lll￢ω￢)也可能是忘了，从本大三人嘴里说出来也是有点不好意思）

开始用的是C语言两个for循环实现的，结果超时了，也可以理解

看了Cprimerplus之后，有点进步吧

但也还要做更多题才能看出来


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