<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Pray_21的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Pray_21</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Pray_21]]></copyright><item><title><![CDATA[comsol报错——无法写入解数据]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/122238895</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/122238895</guid><author>Pray_21</author><pubDate>Thu, 30 Dec 2021 15:52:30 +0800</pubDate><description><![CDATA[将解清除后保存重启该文件并计算可解决

]]></description><category></category></item><item><title><![CDATA[codewars Kata——RGB To Hex Conversion问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/112135879</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/112135879</guid><author>Pray_21</author><pubDate>Sun, 03 Jan 2021 15:58:06 +0800</pubDate><description><![CDATA[代码
# -*- coding: utf-8 -*-
"""
codewars Kata: RGB To Hex Conversion

Created on Sun Jan  3 15:42:25 2021

@author: Pray
"""
def toHex(n):
    if(n &lt;= 0): return '00'
    elif(n &gt;= 255): return 'FF'
    a = int(n / 16)
    b = n % 16
    if (a &gt; 9)]]></description><category></category></item><item><title><![CDATA[codewars Kata——Scramblies问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/112135556</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/112135556</guid><author>Pray_21</author><pubDate>Sun, 03 Jan 2021 15:34:57 +0800</pubDate><description><![CDATA[代码
代码的关键点在于巧妙利用python的Counter函数，见下
# -*- coding: utf-8 -*-
"""
codewars Kata: Scramblies

Created on Sun Jan  3 14:58:48 2021

@author: Pray
"""

s1 = 'katas'
s2 = 'steak'

from collections import Counter  
def scramble(s1, s2):
    return len(Counter(s2) ]]></description><category></category></item><item><title><![CDATA[codewars Kata——Common Denominators问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/112134827</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/112134827</guid><author>Pray_21</author><pubDate>Sun, 03 Jan 2021 14:55:50 +0800</pubDate><description><![CDATA[问题描述
这道题通俗来讲就是要求你对一系列分数进行通分，而且通分后的分母应该是这些原分数分母的最小公倍数。所以此题的解题核心在于求取最小公倍数的算法。
思路与代码
我们采用曲线救国的方针，先求取分母们的最大公因数（Greatest Common Divisor, gcd），然后基于最大公倍数求取最小公倍数。这个思路也很好理解，假设存在两数aaa和bbb，二者的最大公因数为gcd(a,b)gcd(a,b)gcd(a,b)，则aaa和bbb的最大公倍数即为
a∗b/gcd(a,b)a*b/gcd(a,b)a∗b]]></description><category></category></item><item><title><![CDATA[codewars Kata—— Primes in numbers问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/112132871</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/112132871</guid><author>Pray_21</author><pubDate>Sun, 03 Jan 2021 11:49:03 +0800</pubDate><description><![CDATA[大致思路
首先定义一个函数用于判断某数是否为质数，判断思路是从2开始，到该数的平方根为止，遍历判断该数是否能被这些数整除，若能则不为质数，若都不能则为质数。
import math
def isPrime(n):
    sqr = int(math.sqrt(n))                                 #求该数的平方根
    if(n==1):return False                                   #若该数为1，则不是质数
    for]]></description><category></category></item><item><title><![CDATA[codewars Kata——Moving Zeros To The End问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/110366754</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/110366754</guid><author>Pray_21</author><pubDate>Mon, 30 Nov 2020 09:19:36 +0800</pubDate><description><![CDATA[大体思路和代码
刚开始读题的时候很快就有了思路：每一轮用list的index方法找到第一个为0的元素的索引，然后将该元素弹出(pop)，在将其添加(append)在列表末尾。于是我很快写出了代码并进行test，但是发现出现了2个结果报错。
我一看，嗷，原来是佐田……咳咳，原来是这两个test案例中提供的数组包含元素False，而False所属的bool数据类型实际上是int的一个子类(subclass)，所以代码在整理数组时会把False也搬运到末尾，但是根据该题目的要求，False不应该算作0。
于是，我]]></description><category></category></item><item><title><![CDATA[codewars Kata——Product of consecutive Fib numbers问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/110087194</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/110087194</guid><author>Pray_21</author><pubDate>Tue, 24 Nov 2020 17:03:08 +0800</pubDate><description><![CDATA[思路与代码
思路其实很简单，我们已知斐波那契数列是给定两个边界条件（初始值），然后按照F(n+1)=F(n)+F(n-1)的方式递推得到，那么我可以从先给定0，1的初始条件，然后开始逐轮试探，每一轮我们先判断F(n)*F(n+1)&lt;prod是否成立，只要成立，就更新当前的F(n)和F(n+1)，并继续下一轮，这样的逐轮尝试进行到F(n)*F(n+1)≥prod为止，然后返回此时的F(n)、F(n+1)以及F(n)*F(n+1)==prod的bool值。
代码如下：
# -*- coding: utf-]]></description><category></category></item><item><title><![CDATA[codewars Kata——Calculating with Functions问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/109963741</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/109963741</guid><author>Pray_21</author><pubDate>Sun, 22 Nov 2020 21:23:41 +0800</pubDate><description><![CDATA[代码与思路
话不多说，先放代码：
# -*- coding: utf-8 -*-
"""
codewars Kata: Calculating with Functions

Created on Sun Nov 22 20:14:45 2020

@author: Pray
"""

def zero(f = None): return f(0) if callable(f) else 0
def one(f = None): return f(1) if callable(f) else 1
def t]]></description><category></category></item><item><title><![CDATA[codewars Kata——Highest Scoring Word问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/109923306</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/109923306</guid><author>Pray_21</author><pubDate>Sun, 22 Nov 2020 11:23:09 +0800</pubDate><description><![CDATA[大致思路和代码
这个题的思路上没有啥大问题，主要想记录下为每个字母打分的方法，这里利用了ord()函数来实现这一功能，下面我先介绍一下ord()函数
ord()函数介绍
Help on built-in function ord in module builtins:

ord(c, /)
	Return the Unicode code point for a one-character string.

ord() 函数是 chr() 函数（对于8位的ASCII字符串）或 unichr() 函数（对于U]]></description><category></category></item><item><title><![CDATA[codewars Kata——Persistent Bugger问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/109922003</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/109922003</guid><author>Pray_21</author><pubDate>Sun, 22 Nov 2020 10:36:27 +0800</pubDate><description><![CDATA[大致思路和代码
本人解决这一问题的关键思想是函数的递归调用，递归思想及如何实现大家可以自行百度，大致思路就是从上到小不断逐级调用自身，最终调用到底层，即n为一位数时，然后再逐级向上返回值，逐级加一，最后就可以得到persistentence的值了。
话不多说，放代码：
# -*- coding: utf-8 -*-
"""
codewars Kata: Persistent Bugger

Created on Sun Nov 22 09:58:35 2020

@author: Pray
"""

def]]></description><category></category></item><item><title><![CDATA[codewars Kata——IQ Test问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/109921134</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/109921134</guid><author>Pray_21</author><pubDate>Sun, 22 Nov 2020 09:52:20 +0800</pubDate><description><![CDATA[实现思路和代码
由于输入给定是一个字符串，每个数字之间用空格间隔开，所以先对字符串进行分割和转int的操作，然后遍历数组，查看每个数的奇偶性，统计奇数和偶数的个数，同时分别将第一次出现的奇偶数的索引进行记录。最后判断奇偶数的数量，给出目标的索引。
代码如下：
# -*- coding: utf-8 -*-
"""
codewars Kata: IQ Test

Created on Sun Nov 22 09:24:31 2020

@author: Pray
"""

def iq_test(number]]></description><category></category></item><item><title><![CDATA[codewars Kata——Ones and Zeros问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/109894320</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/109894320</guid><author>Pray_21</author><pubDate>Sat, 21 Nov 2020 12:16:29 +0800</pubDate><description><![CDATA[我的实现方法
我的实现方法很简单，直接上代码：
# -*- coding: utf-8 -*-
"""
codewars Kata: Ones and Zeros

Created on Sat Nov 21 12:02:19 2020

@author: Pray
"""

def binary_array_to_number(arr):
    sum = 0
    for i in range(len(arr)):
        sum = sum + arr[i] * 2**(len(arr)-]]></description><category></category></item><item><title><![CDATA[codewars Kata——Take a Ten Minute Walk问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/109893816</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/109893816</guid><author>Pray_21</author><pubDate>Sat, 21 Nov 2020 11:54:18 +0800</pubDate><description><![CDATA[大致思路
如果walk列表长度不为10，那么这个散步方案肯定是不能使我刚好准时回到原地的，那么就return False。如果walk长度为10，则设置初始坐标x=0，y=0，根据’n’ ‘s’ ‘e’ 'w’让y、x分别+1、-1，经过10次计算后，如果x和y同时为0，则回到原点，return True。否则return False。
代码
# -*- coding: utf-8 -*-
"""
codewars Kata: Take a Ten Minute Walk

Created on Sat N]]></description><category></category></item><item><title><![CDATA[codewars Kata——Duplicate Encoder问题]]></title><link>https://blog.youkuaiyun.com/Pray_21/article/details/109892037</link><guid>https://blog.youkuaiyun.com/Pray_21/article/details/109892037</guid><author>Pray_21</author><pubDate>Sat, 21 Nov 2020 11:05:46 +0800</pubDate><description><![CDATA[大致思路
利用字典dict数据结构，将字符串中的字符与该字符出现的次数建立一一对应的映射关系，通过遍历字符串检视每一字符出现的次数来决定生成新字符的内容
代码
# -*- coding: utf-8 -*-
"""
Kata Duplicate Encoder

Created on Sat Nov 21 10:11:07 2020

@author: Pray
"""

def duplicate_encode(word):
    #your code here
    newword=[]      ]]></description><category></category></item></channel></rss>