<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[math_computer的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/math_computer</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; math_computer]]></copyright><item><title><![CDATA[感冒用药记录]]></title><link>https://blog.csdn.net/math_computer/article/details/142828489</link><guid>https://blog.csdn.net/math_computer/article/details/142828489</guid><author>math_computer</author><pubDate>Thu, 10 Oct 2024 18:03:42 +0800</pubDate><description><![CDATA[接着1天：使用复方感冒灵片【含对乙酰氨基酚】，并且用生理盐水洗鼻孔，鼻塞缓解可安睡。– 中间2天：开始喉痛，使用复方氨酚烷胺胶囊【含对乙酰氨基酚】，基本没有效果。– 后面1天：开始鼻塞无法入睡，使用感冒灵颗粒，尝试捂被子，发低烧，没有缓解。总结：鼻塞无法入睡确实痛苦，生理盐水洗鼻孔以及捏鼻子然后放开对通气和减排有效。问题描述：国庆感冒了，头昏喉咙不舒服。– 前3天：未用药，不好也不坏。]]></description><category></category></item><item><title><![CDATA[推荐几本对我有影响的书]]></title><link>https://blog.csdn.net/math_computer/article/details/132362423</link><guid>https://blog.csdn.net/math_computer/article/details/132362423</guid><author>math_computer</author><pubDate>Fri, 18 Aug 2023 15:48:25 +0800</pubDate><description><![CDATA[这几本书，有理性的，有感性的。值得读很多遍。]]></description><category></category></item><item><title><![CDATA[小树也能读懂的零点定理弱形式]]></title><link>https://blog.csdn.net/math_computer/article/details/117487973</link><guid>https://blog.csdn.net/math_computer/article/details/117487973</guid><author>math_computer</author><pubDate>Sun, 06 Jun 2021 19:09:47 +0800</pubDate><description><![CDATA[文章目录整数的故事Noether正规化引理零点定理弱形式
整数的故事
整数，大家再熟悉不过的东西。可是，一旦考虑上面的运算，事情就没有单纯了。整数的运算性质一直是数论的核心兴趣所在。素数，不定方程都是在运算的基础上进行考虑的。高斯的时代，人们考虑用多项式表达整数，比如x2+y2=nx^2+y^2=nx2+y2=n，当nnn为何值时，这个方程有整数解，解集又是什么。如果继续解方程和因式分解是一回事的思想，考虑将左边进行分解x2+y2=(x+iy)(x−iy)x^2+y^2=(x+iy)(x-iy)x2+y2=]]></description><category></category></item><item><title><![CDATA[小树也能读懂的唯一因子分解整环]]></title><link>https://blog.csdn.net/math_computer/article/details/117396380</link><guid>https://blog.csdn.net/math_computer/article/details/117396380</guid><author>math_computer</author><pubDate>Sun, 30 May 2021 12:14:45 +0800</pubDate><description><![CDATA[文章目录算术基本定理
算术基本定理
打小学起，我们就知道正整数有一些基本单元叫做素数，它们除了1和自身外没有其他的因子。除了1之外的数，如果不是素数，就叫做合数，合数可以分解成素数的乘积，比如，12=2×2×312=2\times 2\times 312=2×2×3。而且，这种分解是唯一确定的。那时候，我们不会是思考为什么这种分解是存在的，更不会思考为什么这种分解是唯一的。我们把老师和课本当成是权威，所说所写都是真理。稍微肯思考的孩子，动手写了几个例子，发现也确实是对的。那时候，一切只需要陈述和应用，证明看]]></description><category></category></item><item><title><![CDATA[小树也能读懂的希尔伯特基定理]]></title><link>https://blog.csdn.net/math_computer/article/details/117380939</link><guid>https://blog.csdn.net/math_computer/article/details/117380939</guid><author>math_computer</author><pubDate>Sat, 29 May 2021 13:32:53 +0800</pubDate><description><![CDATA[文章目录从带余除法说起多项式的故事整系数多项式
从带余除法说起
打小学起，我们就开始接触整数，知道1+1=2，知道加减乘除。可是，整数除以整数一般是整除不下来的，比如7÷2=3⋯⋯17\div 2=3\cdots\cdots 17÷2=3⋯⋯1。 这个式子用乘法来写就是5=3×2+15=3\times 2+15=3×2+1。我们用符号来表达，aaa表示被除数，bbb表示除数，qqq表示商，rrr表示余数，则有
a=qb+r.a=qb+r.a=qb+r.
这里，我们约定下b&gt;0b&gt;0b&gt;0，]]></description><category></category></item><item><title><![CDATA[linux常用操作总结自用]]></title><link>https://blog.csdn.net/math_computer/article/details/108250236</link><guid>https://blog.csdn.net/math_computer/article/details/108250236</guid><author>math_computer</author><pubDate>Thu, 27 Aug 2020 00:02:17 +0800</pubDate><description><![CDATA[看文件第一行：

head -n 1 filename


看文件最后一行：

tail -n 1 filename


统计文件行数：

cat filename | wc -l


]]></description><category></category></item><item><title><![CDATA[解决mac安装brew时的问题]]></title><link>https://blog.csdn.net/math_computer/article/details/108047215</link><guid>https://blog.csdn.net/math_computer/article/details/108047215</guid><author>math_computer</author><pubDate>Mon, 17 Aug 2020 00:25:49 +0800</pubDate><description><![CDATA[首先是要安装 Xcode command line tool :
sudo xcode-select --install


然后就可以安装了（这里是参考了mac安装homebrew失败怎么办？，一般的方法大概率会出现网络问题）：
/bin/zsh -c "$(curl -fsSL https://gitee.com/cunkai/HomebrewCN/raw/master/Homebrew.sh)"



...]]></description><category></category></item><item><title><![CDATA[快速将图片容量变小]]></title><link>https://blog.csdn.net/math_computer/article/details/107607539</link><guid>https://blog.csdn.net/math_computer/article/details/107607539</guid><author>math_computer</author><pubDate>Mon, 27 Jul 2020 11:14:06 +0800</pubDate><description><![CDATA[右键 选择 打开方式， 使用 画图 打开
选择 重新调整大小，百分比选择 50， 关闭，选择 保存


]]></description><category></category></item><item><title><![CDATA[写个汉诺塔吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107169362</link><guid>https://blog.csdn.net/math_computer/article/details/107169362</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:05:41 +0800</pubDate><description><![CDATA[def hano(A, B, F, n):
    if n == 1:
        move(A, B, n)
    else:
        hano(A, F, B, n - 1)
        move(A, B, n)
        hano(F, B, A, n - 1)


def move(A, B, m):
    print(f"move {m} from {A} to {B}")

# 测试通过
hano("A", "B", "F", n=4)  
# 1,2,3,4四个圆]]></description><category></category></item><item><title><![CDATA[写个最长公共子序列（子串）吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107179850</link><guid>https://blog.csdn.net/math_computer/article/details/107179850</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:05:29 +0800</pubDate><description><![CDATA[def longest_common_subseq(str1, str2):
    value = [[0 for j in range(len(str2) + 1)] for i in range(len(str1) + 1)]
    for i in range(1, len(str1) + 1):
        for j in range(1, len(str2) + 1):
            if str1[i - 1] == str2[j - 1]:
                ]]></description><category></category></item><item><title><![CDATA[写个堆排序吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107124847</link><guid>https://blog.csdn.net/math_computer/article/details/107124847</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:05:03 +0800</pubDate><description><![CDATA[def tune_heap(arr, heapsize, root):
    left = 2 * root + 1
    right = left + 1
    larger = root
    if left &lt; heapsize and arr[larger] &lt; arr[left]:
        larger = left
    if right &lt; heapsize and arr[larger] &lt; arr[right]:
        larger = ]]></description><category></category></item><item><title><![CDATA[写个快速排序吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107081455</link><guid>https://blog.csdn.net/math_computer/article/details/107081455</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:04:54 +0800</pubDate><description><![CDATA[def quick_sort(arr):
	if not arr or len(arr) == 1:
		return arr
	k, new_arr = partition(arr)
	return quick_sort(new_arr[:k]) + [new_arr[k]] + quick_sort(new_arr[k + 1 :])
    # 保证子序列一定严格小于原序列	
	
def partition(arr):
	tmp = arr[-1]
	i, j = 0, 0
	while j &lt;]]></description><category></category></item><item><title><![CDATA[写个插入排序吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107074630</link><guid>https://blog.csdn.net/math_computer/article/details/107074630</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:04:45 +0800</pubDate><description><![CDATA[def insert_sort(arr):  # 检查边界情况没问题
	j = 1
	while j &lt; len(arr):
		tmp = arr[j]  # 临时保存
		i = j - 1
		while i &gt;= 0 and arr[i] &gt; tmp:
			arr[i + 1] = arr[i]  # 移动
			i -= 1
		arr[i + 1] = tmp  # 插入
		j += 1
			
arr1 = []
arr2 = [2]
arr3 = [2, 1]
arr4]]></description><category></category></item><item><title><![CDATA[写个归并排序吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107079214</link><guid>https://blog.csdn.net/math_computer/article/details/107079214</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:04:35 +0800</pubDate><description><![CDATA[def merge(p, q):
	res = []
	i, j = 0, 0
	while i &lt; len(p) and j &lt; len(q):
		if p[i] &lt;= q[j]:
			res.append(p[i])
			i += 1
		else:
			res.append(q[j])
			j += 1
	return res + p[i:] + q[j:]

arr1 = []
arr2 = [2]
arr3 = [2, 1]
arr4 = [10, 9, 8, 11, ]]></description><category></category></item><item><title><![CDATA[写个二分查找吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107074309</link><guid>https://blog.csdn.net/math_computer/article/details/107074309</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:03:31 +0800</pubDate><description><![CDATA[def bi_search(arr, t):
	if not arr or t &lt; arr[0] or t &gt; arr[-1]:  # 边界情形
		return None
	begin, end = 0, len(arr) - 1
	while begin &lt;= end:
		mid = begin + (end - begin) // 2  # 防止大数相加溢出
		if t == arr[mid]:
			return mid
		elif t &lt; arr[mid]:
			e]]></description><category></category></item><item><title><![CDATA[写个旋转矩阵吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107125466</link><guid>https://blog.csdn.net/math_computer/article/details/107125466</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:03:13 +0800</pubDate><description><![CDATA[def rot(a):
    n = len(a)
    if n &lt;= 1:
        return a
    for i in range(n // 2):
        for j in range(i, n - i - 1):
            tmp = a[i][j]
            a[i][j] = a[n - 1 - j][i]
            a[n - 1 - j][i] = a[n - 1 - i][n - 1 - j]
          ]]></description><category></category></item><item><title><![CDATA[写个最长无重复子串吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107127172</link><guid>https://blog.csdn.net/math_computer/article/details/107127172</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:03:04 +0800</pubDate><description><![CDATA[def length_of_longest_substring(st):
    max_length = 0
    max_substring = ""
    if not st:
        return 0, ""
    i, j = 0, 0
    while j &lt; len(st):
        if st[j] not in st[i:j]:
            j += 1
            if j == len(st):
                if]]></description><category></category></item><item><title><![CDATA[写个连通域吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107134353</link><guid>https://blog.csdn.net/math_computer/article/details/107134353</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:02:55 +0800</pubDate><description><![CDATA[def connected_regions_areas(mat):
    if not mat:
        return [], []
    regions = []
    areas = []
    m, n = len(mat), len(mat[0])
    label_table = [[0 for j in range(n)] for i in range(m)]
    label = 1
    d = [(-1, 0), (1, 0), (0, -1), (0, 1),
  ]]></description><category></category></item><item><title><![CDATA[写个最大子序和吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107169787</link><guid>https://blog.csdn.net/math_computer/article/details/107169787</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:02:43 +0800</pubDate><description><![CDATA[连续子序列和最大
def max_sub_array(nums):
    tmp, next_ = nums[0], nums[0]
    max_value = nums[0]
    for i in range(1, len(nums)):
        next_ = tmp + nums[i] if tmp &gt; 0 else nums[i]
        if max_value &lt; next_:
            max_value = next_
        tm]]></description><category></category></item><item><title><![CDATA[写个活动选择问题吧~]]></title><link>https://blog.csdn.net/math_computer/article/details/107171483</link><guid>https://blog.csdn.net/math_computer/article/details/107171483</guid><author>math_computer</author><pubDate>Sun, 12 Jul 2020 15:02:28 +0800</pubDate><description><![CDATA[选出最大不冲突的活动列表
def activity_selection(s, f):
    m = [0]
    tmp = f[0]
    for i in range(1, len(f)):
        next_ = s[i]
        if next_ &gt;= tmp:
            m.append(i)
            tmp = f[i]
        if i &lt; len(f) - 1:
            next_ = s[i + 1]
]]></description><category></category></item></channel></rss>