<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sinat_14826343的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sinat_14826343</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sinat_14826343]]></copyright><item><title><![CDATA[Lua学习笔记之for]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/75007604</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/75007604</guid><author>sinat_14826343</author><pubDate>Wed, 12 Jul 2017 11:34:27 +0800</pubDate><description><![CDATA[Lua中的迭代器与泛型for]]></description><category></category></item><item><title><![CDATA[Lua学习笔记之table]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/74640817</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/74640817</guid><author>sinat_14826343</author><pubDate>Fri, 07 Jul 2017 11:16:55 +0800</pubDate><description><![CDATA[零散知识点记录
table的拷贝是浅拷贝，若要深拷贝A=B则需要遍历B中的元素，并将其一一对应赋值给A。]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十九周：  567. Permutation in String]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/74418824</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/74418824</guid><author>sinat_14826343</author><pubDate>Wed, 05 Jul 2017 13:28:11 +0800</pubDate><description><![CDATA[class Solution(object):
    def checkInclusion(self, s1, s2):
        l1 = [0 for _ in range(26)]
        l2 = [0 for _ in range(26)]
        size1 = len(s1)
        size2 = len(s2)
        if size2 <]]></description><category></category></item><item><title><![CDATA[Lua学习笔记之function type]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/74387455</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/74387455</guid><author>sinat_14826343</author><pubDate>Wed, 05 Jul 2017 10:33:52 +0800</pubDate><description><![CDATA[Here we list all functions and types from the C API in alphabetical order. Each function has an indicator like this:[-o, +p, x]




The first field, o, is how many elements the function pops from]]></description><category></category></item><item><title><![CDATA[Lua学习笔记之Coroutine]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/74356910</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/74356910</guid><author>sinat_14826343</author><pubDate>Tue, 04 Jul 2017 20:59:26 +0800</pubDate><description><![CDATA[2.11 – Coroutines

Lua supports coroutines, also called collaborative multithreading. A coroutine in Lua represents an independent thread of execution. Unlike threads in multithread systems, however]]></description><category></category></item><item><title><![CDATA[Lua学习笔记之Expressions]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/74354699</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/74354699</guid><author>sinat_14826343</author><pubDate>Tue, 04 Jul 2017 19:33:18 +0800</pubDate><description><![CDATA[Both function calls and vararg expressions can result in multiple values. If an expression is used as a statement (only possible for function calls (see §2.4.6)),
 then its return list is adjusted to]]></description><category></category></item><item><title><![CDATA[课程调度问题：LeetCode 630. Course Schedule III]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/73739638</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/73739638</guid><author>sinat_14826343</author><pubDate>Mon, 26 Jun 2017 14:19:47 +0800</pubDate><description><![CDATA[题目描述： 
There are n different online courses numbered from 1 to n. Each course has some duration(course length) t and closed on dth day. A course should be taken continuously for t days and must be fini]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十八周：592. Fraction Addition and Subtraction]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/73732921</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/73732921</guid><author>sinat_14826343</author><pubDate>Mon, 26 Jun 2017 10:24:45 +0800</pubDate><description><![CDATA[class Solution(object):
    def fractionAddition(self, expression):
        def gcd(a, b):
            a = abs(a)
            b = abs(b)
            if a == 0 or b == 0:
                return 1]]></description><category></category></item><item><title><![CDATA[8.8 精确4SAT问题证明]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/73188700</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/73188700</guid><author>sinat_14826343</author><pubDate>Tue, 13 Jun 2017 17:18:27 +0800</pubDate><description><![CDATA[思路： 
若一个问题为NP问题，要证明该问题是NPC问题，只需要将一个已知的NPC问题规约为该问题即可。 
规约过程分两步：
将已知的NPC问题的实例转化为该问题的实例。
将已知的NPC问题的解转化为该问题的解。
已知3SAT问题是NPC问题，所以 利用3SAT问题进行规约证明。 
 证明过程：
4精确SAT问题跟3SAT问题都是NP问题
规约过程： 
给定一个3SAT问题的实例：X={x1,x2,]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十七周：611. Valid Triangle Number]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/73116290</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/73116290</guid><author>sinat_14826343</author><pubDate>Mon, 12 Jun 2017 15:51:21 +0800</pubDate><description><![CDATA[class Solution {
public:
    int triangleNumber(vector<int>& nums) {
        //排序数组
        sort(nums.begin(), nums.end());
        //删除零元素
        while (1) {
            //若数组中边长个数少于3，则直接返回0]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十六周：582. kill process]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/72867967</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/72867967</guid><author>sinat_14826343</author><pubDate>Mon, 05 Jun 2017 15:40:24 +0800</pubDate><description><![CDATA[class Solution(object):
    def killProcess(self, pid, ppid, kill):
        """
        :type pid: List[int]
        :type ppid: List[int]
        :type kill: int
        :rtype: List[int]
        """]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十五周：593. Valid Square]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/72781578</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/72781578</guid><author>sinat_14826343</author><pubDate>Sat, 27 May 2017 15:07:43 +0800</pubDate><description><![CDATA[import mathclass Solution(object):
    def validSquare(self, p1, p2, p3, p4):
        #计算两点之间距离的函数
        def dist(p1, p2):
            return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十四周：424. Longest Repeating Character Replacement]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/72628181</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/72628181</guid><author>sinat_14826343</author><pubDate>Mon, 22 May 2017 17:21:30 +0800</pubDate><description><![CDATA[class Solution(object):
    def characterReplacement(self, s, k):        if s == "":
            return 0
        char = [0 for _ in range(26)]
        i, j = 0, 0
        maxCnt = 1
        for c in s]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十三周：582. Kill Process]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/72188513</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/72188513</guid><author>sinat_14826343</author><pubDate>Mon, 15 May 2017 17:55:55 +0800</pubDate><description><![CDATA[class Solution(object):
    def killProcess(self, pid, ppid, kill):        dict1 = {}
        size = len(pid)
        res = [kill]
        for i in range(size):
            if dict1.get(ppid[i]) == Non]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十二周：473. Matchsticks to Square]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/71436367</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/71436367</guid><author>sinat_14826343</author><pubDate>Mon, 08 May 2017 21:49:20 +0800</pubDate><description><![CDATA[Description: 
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchstic]]></description><category></category></item><item><title><![CDATA[【0-1 knapsack】 474. Ones and Zeroes]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/71125331</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/71125331</guid><author>sinat_14826343</author><pubDate>Wed, 03 May 2017 16:50:51 +0800</pubDate><description><![CDATA[Description: 
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On]]></description><category></category></item><item><title><![CDATA[560. Subarray Sum Equals K]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/71083293</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/71083293</guid><author>sinat_14826343</author><pubDate>Tue, 02 May 2017 16:53:34 +0800</pubDate><description><![CDATA[Description: 
Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.Solution:
暴力列举所有可能的子连续序列和
计算前n个序列的和，并储存与map中，再根据nums[0:i] - nu]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十一周：416. Partition Equal Subset Sum]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/71076320</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/71076320</guid><author>sinat_14826343</author><pubDate>Mon, 01 May 2017 23:30:07 +0800</pubDate><description><![CDATA[思路： 
1.对数组进行排序并取得数组的总和 
2.从大到小对数组进行筛选 
3.只要有一种可行方案即返回Trueclass Solution(object):
    def canPartition(self, nums):
        if len(nums) <= 1:
            return False        sum1 = sum(nums)
        nu]]></description><category></category></item><item><title><![CDATA[491. Increasing Subsequences]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/70767402</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/70767402</guid><author>sinat_14826343</author><pubDate>Tue, 25 Apr 2017 21:13:31 +0800</pubDate><description><![CDATA[class Solution(object):
    def findSubsequences(self, nums):
        #先将list转成tuple
        #然后将tuple保存在set中
        #并利用set来判断list是否已存在
        self.__res = set()
        def rec(nums, l, cnt, val):]]></description><category></category></item><item><title><![CDATA[算法分析与设计第十周：384. Shuffle an Array]]></title><link>https://blog.youkuaiyun.com/sinat_14826343/article/details/70597606</link><guid>https://blog.youkuaiyun.com/sinat_14826343/article/details/70597606</guid><author>sinat_14826343</author><pubDate>Mon, 24 Apr 2017 14:20:32 +0800</pubDate><description><![CDATA[class Solution(object):    def __init__(self, nums):
        """
        :type nums: List[int]
        """
        self.__l = nums
        self.__size = len(nums)    def reset(self):
        """]]></description><category></category></item></channel></rss>