<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ayangyangyang25的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ayangyangyang25</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ayangyangyang25]]></copyright><item><title><![CDATA[【测试设计】测试设计编写逻辑]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/132277898</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/132277898</guid><author>ayangyangyang25</author><pubDate>Mon, 14 Aug 2023 15:56:38 +0800</pubDate><description><![CDATA[参考：https://www.zhihu.com/question/51558124/answer/1367193456。]]></description><category></category></item><item><title><![CDATA[collection类：处理Python列表和字典]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/131719407</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/131719407</guid><author>ayangyangyang25</author><pubDate>Fri, 14 Jul 2023 15:17:16 +0800</pubDate><description><![CDATA[List类




关键字
说明




convert_to_list
转换为python的list类型


append_to_list
将元素加入列表


insert_into_list
将元素插入列表指定位置


combine_lists
将列表按顺序合并


set_list_value
设置列表指定位置的值


remove_values_from_list
去除列表中指定Values


remove_from_list
去除列表中指定位置的值


remove_duplicates
对列]]></description><category></category></item><item><title><![CDATA[Builtln库常用关键字]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/131695488</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/131695488</guid><author>ayangyangyang25</author><pubDate>Fri, 14 Jul 2023 10:30:20 +0800</pubDate><description><![CDATA[Converter类：类型转换




关键字
解释




convert_to_integer



convert_to_binary



convert_to_octal
将指定的内容转换为八进制形式


convert_to_hex
将指定的内容转换为十六进制形式


convert_to_number
将指定的内容转换为数字型


convert_to_string



convert_to_boolean



convert_to_bytes



create_list



crea]]></description><category></category></item><item><title><![CDATA[【python基础】]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/131598176</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/131598176</guid><author>ayangyangyang25</author><pubDate>Fri, 07 Jul 2023 16:08:37 +0800</pubDate><description><![CDATA[=函数的默认值是在函数定义的过程计算的，并且只会计算一次。此时调用f(1)、f(2)、f(3)，返回[1],[2],[3]]]></description><category></category></item><item><title><![CDATA[《金字塔原理》]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/126035237</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/126035237</guid><author>ayangyangyang25</author><pubDate>Thu, 28 Jul 2022 15:01:20 +0800</pubDate><description><![CDATA[金字塔原理》分为四个部分，表达的逻辑，思考的逻辑，解决问题的逻辑，演示的逻辑。]]></description><category></category></item><item><title><![CDATA[【数据结构】【字符串】【找相同子串】]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/109721966</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/109721966</guid><author>ayangyangyang25</author><pubDate>Mon, 16 Nov 2020 15:17:07 +0800</pubDate><description><![CDATA[https://www.bilibili.com/video/BV1Kb411W75N?p=477
package com.aiguigu.exer;

import org.junit.Test;

public class StringDemo {

    /*用双指针，双重遍历
    * 将短的字符串进行长度依次递减的子串与较长的串比较  类似最大公约数*/
    public String getMaxSameString(String str1,String str2){

        ]]></description><category></category></item><item><title><![CDATA[【数据结构】【贪心】【加油站】]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/109386909</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/109386909</guid><author>ayangyangyang25</author><pubDate>Fri, 30 Oct 2020 16:18:16 +0800</pubDate><description><![CDATA[https://www.nowcoder.com/practice/3b1abd8ba2e54452b6e18b31780b3635?tpId=46&amp;tags=&amp;title=&amp;diffculty=0&amp;judgeStatus=0&amp;rp=1

题目描述

环形路上有n个加油站，第i个加油站的汽油量是gas[i].

你有一辆车，车的油箱可以无限装汽油。从加油站i走到下一个加油站（i+1）花费的油量是cost[i]，你从一个加油站出发，刚开始的时候油箱里面没有汽油。

求从]]></description><category></category></item><item><title><![CDATA[【数据结构】【贪心】【电台集合覆盖问题】]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/109382422</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/109382422</guid><author>ayangyangyang25</author><pubDate>Fri, 30 Oct 2020 15:20:38 +0800</pubDate><description><![CDATA[遍历所有的广播电台, 找到一个覆盖了最多未覆盖的地区的电台(此电台可能包含一些已覆盖的地区，但没有关系）
	将这个电台加入到一个集合中(比如ArrayList), 想办法把该电台覆盖的地区在下次比较时去掉。
	重复第1步直到覆盖了全部的地区





import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

public class GreedyAlgo.]]></description><category></category></item><item><title><![CDATA[【数据结构】【图及算法】深度优先搜索，拓扑排序，强连通分支，最短路径问题，最小生成树]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108664414</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108664414</guid><author>ayangyangyang25</author><pubDate>Wed, 23 Sep 2020 11:33:19 +0800</pubDate><description><![CDATA[from pythonds.graphs import Graph

###BFS采用队列存储待访问顶点
###DFS则是通过递归调用，隐式使用了栈
class DFSGraph(Graph):
    def __init__(self):
        super().__init__()
        self.time = 0

    def dfs(self):
        for aVertex in self:
            aVertex.setColor(...]]></description><category></category></item><item><title><![CDATA[【数据结构】【图及算法】词梯问题，广度优先搜索，骑士周游问题]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108630750</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108630750</guid><author>ayangyangyang25</author><pubDate>Fri, 18 Sep 2020 14:20:50 +0800</pubDate><description><![CDATA[class Vertex:
    def __init__(self,key):
        self.id = key
        self.connectedTo = {}

    def addNeighbor(self,nbr,weight=0):  # 加边  nbr是顶点对象的key
        self.connectedTo[nbr] = weight

    def __str__(self):
       ...]]></description><category></category></item><item><title><![CDATA[【数据结构】【树及算法】二叉查找树，平衡二叉查找树AVL树]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108589846</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108589846</guid><author>ayangyangyang25</author><pubDate>Wed, 16 Sep 2020 21:15:10 +0800</pubDate><description><![CDATA[二叉查找树
]]></description><category></category></item><item><title><![CDATA[【数据结构】【树及算法】二叉树的实现，树的应用：表达式解析，树的遍历，优先队列和二叉堆]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108569155</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108569155</guid><author>ayangyangyang25</author><pubDate>Mon, 14 Sep 2020 22:39:05 +0800</pubDate><description><![CDATA[用list实现二叉树








def BinaryTree(r):  # 创建二叉树
    return [r,[],[]]

def insertLeft(root,newBranch):  # 在原树上左子树插入新值
    t = root.pop(1)
    if len(t) &gt; 1:
        root.insert(1,[newBranch,t,[]])  # [newBranch,t 为左子树,[] 为右子树 ]
    else:
   ...]]></description><category></category></item><item><title><![CDATA[【数据结构】【排序与查找】散列，区块链，散列函数设计，映射]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108563951</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108563951</guid><author>ayangyangyang25</author><pubDate>Sun, 13 Sep 2020 21:55:32 +0800</pubDate><description><![CDATA[散列

























区块链













散列函数设计



、






def hash(astring, tablesize):
    sum = 0
    for pos in range(len(astring)):
        sum = sum + ord(astring[pos])

    return sum%tablesize




]]></description><category></category></item><item><title><![CDATA[【数据结构】【排序与查找】谢尔排序，归并排序，快速排序]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108202012</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108202012</guid><author>ayangyangyang25</author><pubDate>Mon, 24 Aug 2020 17:41:14 +0800</pubDate><description><![CDATA[谢尔排序










def shellSort(alist):
    sublistcount = len(alist) // 2  # 间隔设定
    while sublistcount &gt; 0:
        for startposition in range(sublistcount):  # 子列表排序
            gapInsertionSort(alist,startposition,sublistcount)
        
        print(]]></description><category></category></item><item><title><![CDATA[【数据结构】【排序与查找】冒泡排序，选择排序，插入排序]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108151230</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108151230</guid><author>ayangyangyang25</author><pubDate>Mon, 24 Aug 2020 16:25:32 +0800</pubDate><description><![CDATA[冒泡排序








def bubbleSort(alist):
    for passnum in range(len(alist)-1, 0, -1):
        for i in range(passnum):  # n-1趟
            if alist[i] &gt; alist[i+1]:
                temp = alist[i]  # 交换
                alist[i] = alist[i+1]
               ]]></description><category></category></item><item><title><![CDATA[【数据结构】【排序与查找】顺序查找，二分查找]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108149956</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108149956</guid><author>ayangyangyang25</author><pubDate>Fri, 21 Aug 2020 17:06:19 +0800</pubDate><description><![CDATA[def sequentialSearch(alist, item):
    """无序表查找
    """
    pos = 0
    found = False
    while pos &lt; len(alist) and not found:
        if alist[pos] == item:
            found = True
        else:
            pos = pos + 1
    
    return found

tes...]]></description><category></category></item><item><title><![CDATA[【数据结构】【动态规划】博物馆大盗问题]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108148429</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108148429</guid><author>ayangyangyang25</author><pubDate>Fri, 21 Aug 2020 16:26:25 +0800</pubDate><description><![CDATA[# 宝物的重量和价值
tr = [None, {'w':2, 'v':3},{'w':3, 'v':4},
            {'w':4, 'v':8},{'w':5, 'v':8},
            {'w':9, 'v':10}]

# 大盗最大承重
max_w = 20

# 初始化二维表格m[(i,w)]
# 表示前i个宝物中，最大重量w的组合，所得到的最大价值
# 当i什么都不取，或w上限为0，价值均为0
m = {(i, w):0 for i in range(le...]]></description><category></category></item><item><title><![CDATA[【数据结构】【递归】四.分治策略，优化贪心，找零兑换问题，动态优化]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108140770</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108140770</guid><author>ayangyangyang25</author><pubDate>Fri, 21 Aug 2020 15:35:12 +0800</pubDate><description><![CDATA[def recMC(coinValueList,change):
    minCoins = change
    if change in coinValueList:  # 最小规模，直接返回
        return 1
    else:
        for i in [c for c in coinValueList if c &lt;= change]:
            # 减小规模：每次减去一种硬币面值挑选最小数量
           ...]]></description><category></category></item><item><title><![CDATA[【数据结构】【递归】三.汉诺塔，探索迷宫]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108127265</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108127265</guid><author>ayangyangyang25</author><pubDate>Fri, 21 Aug 2020 09:21:18 +0800</pubDate><description><![CDATA[def moveTower(height, fromPole, withPole, toPole):
    if height &gt;= 1:
        moveTower(height-1, fromPole, toPole, withPole)  # 将n-1个盘片从开始柱，经由目标柱，移动到中间柱
        moveDisk(height, fromPole, toPole)  # 将第n个（最大的）盘片，从开始柱移到目标柱
        moveTower(hei...]]></description><category></category></item><item><title><![CDATA[【数据结构】【递归】二.可视化：分形树，谢尔宾斯基三角]]></title><link>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108126054</link><guid>https://blog.youkuaiyun.com/ayangyangyang25/article/details/108126054</guid><author>ayangyangyang25</author><pubDate>Thu, 20 Aug 2020 16:48:19 +0800</pubDate><description><![CDATA[import turtle

def tree(branch_len):
    if branch_len &gt; 5:  # 树干太短不画，即递归结束条件
        t.forward(branch_len)  # 画树干
        t.right(20)  # 右倾斜20度
        tree(branch_len - 15)  # 递归调用，画右边的小树，树干减15
        t.left(40)  # 向左回40度，即左倾斜20度
     ...]]></description><category></category></item></channel></rss>