<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lisa___33的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lisa___33</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lisa___33]]></copyright><item><title><![CDATA[Leetcode 第 120 场周赛----在二叉树中分配硬币]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/86563100</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/86563100</guid><author>lisa___33</author><pubDate>Sun, 20 Jan 2019 16:50:06 +0800</pubDate><description><![CDATA[给定一个有 N 个结点的二叉树的根结点 root，树中的每个结点上都对应有 node.val 枚硬币，并且总共有 N 枚硬币。

在一次移动中，我们可以选择两个相邻的结点，然后将一枚硬币从其中一个结点移动到另一个结点。(移动可以是从父结点到子结点，或者从子结点移动到父结点。)。

返回使每个结点上只有一枚硬币所需的移动次数。

原题链接：

在二叉树中分配硬币

 

解题思路：

小白为了练手，...]]></description><category></category></item><item><title><![CDATA[我要开始我的shader辣]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/81750249</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/81750249</guid><author>lisa___33</author><pubDate>Thu, 16 Aug 2018 22:50:26 +0800</pubDate><description><![CDATA[首先分享几个学习shader的网站：

shadertoy学习分享网站：https://www.shadertoy.com/

shader大牛网站：http://www.iquilezles.org/www/index.htm

还有几篇引导入门的博客：

https://gamedevelopment.tutsplus.com/tutorials/a-beginners-guide-to-co...]]></description><category></category></item><item><title><![CDATA[Linux共享文件夹的方法]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/80653108</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/80653108</guid><author>lisa___33</author><pubDate>Mon, 11 Jun 2018 15:42:57 +0800</pubDate><description><![CDATA[被作了那么多次，千百种方法，这种对我最简单最有效，写下来1、完成windows上的共享文件夹权限开放给everyone的设置2、打开linux虚拟机，选择设置，点击添加新的挂载点3、选择在windows上前面设置的共享文件夹的路径，并且命名好其在当下Linux系统下的代名4、打开linux的终端，首先创建一个挂载的目录mkdir /mnt/Windows_Share3/5、设置挂载输入如下命令：m...]]></description><category></category></item><item><title><![CDATA[论文Stack Hourglass实战环境配置教程（装了两天的我决定分享一下）]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/79840367</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/79840367</guid><author>lisa___33</author><pubDate>Sat, 07 Apr 2018 12:40:23 +0800</pubDate><description><![CDATA[环境要求：Torch7hdf5 (and the torch-hdf5 package，这个包其实在Torch7安装的时候就安装了，不用管，只需要下载hdf5)cudnnqlua (for displaying results)安装cuda，因为安装cudnn前需要安装cuda: cuda安装教程   （注意一定要先确保虚拟机的磁盘分区空间足够，这个文件1.9G呢！光下载就1.9G，后面安装也需要...]]></description><category></category></item><item><title><![CDATA[算法设计期末作业-08-8.22]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/75137981</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/75137981</guid><author>lisa___33</author><pubDate>Fri, 14 Jul 2017 23:17:55 +0800</pubDate><description><![CDATA[题目 ##（题目比较长，找了一个中文版的贴在下面）在任务调度，常常会用到图。其中节点应用于任务，任务i到j的有向边表示i是j的先期条件。这样的图描述了调度问题中的任务先后关系（约束） 。显然，一个调度是可行的当且仅当该图无环；如果调度不可行，我们需要使其无环所需的最小约束数量。 
给定一个有向图G =（V，E），子集E’⊆E称为一个反馈弧集，反馈弧集是指将其移除后，将使得G无环。 
反馈弧集（FAS]]></description><category></category></item><item><title><![CDATA[算法设计期末作业-08-8.22]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/75137980</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/75137980</guid><author>lisa___33</author><pubDate>Fri, 14 Jul 2017 23:17:38 +0800</pubDate><description><![CDATA[题目 ##（题目比较长，找了一个中文版的贴在下面）在任务调度，常常会用到图。其中节点应用于任务，任务i到j的有向边表示i是j的先期条件。这样的图描述了调度问题中的任务先后关系（约束） 。显然，一个调度是可行的当且仅当该图无环；如果调度不可行，我们需要使其无环所需的最小约束数量。 
给定一个有向图G =（V，E），子集E’⊆E称为一个反馈弧集，反馈弧集是指将其移除后，将使得G无环。 
反馈弧集（FAS]]></description><category></category></item><item><title><![CDATA[算法设计期末作业07-8.16]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/75088657</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/75088657</guid><author>lisa___33</author><pubDate>Thu, 13 Jul 2017 17:59:37 +0800</pubDate><description><![CDATA[题目有点长久去网上截了一个一小段的题目题目菜谱和3SAT问题 
Input: n, the number of ingredients to choose from: D,the n*n “discord” matrix; some number p >= 0 
Output: The maximum number of ingredients we can choose with penalty]]></description><category></category></item><item><title><![CDATA[算法设计期末作业-06-8.15]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/75086063</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/75086063</guid><author>lisa___33</author><pubDate>Thu, 13 Jul 2017 17:12:22 +0800</pubDate><description><![CDATA[题目Show that the following problem is NP-complete. 
MAXIMUM COMMON SUBGRAPH 
Input: Two graphs G1=(V1,E1) and G2=(V2,E2);a budget b. 
Output: Two set of nodes V1’属于V1, and V2’属于V2 whose deletion leaves]]></description><category></category></item><item><title><![CDATA[算法设计期末作业05-8.14]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/75081081</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/75081081</guid><author>lisa___33</author><pubDate>Thu, 13 Jul 2017 16:44:55 +0800</pubDate><description><![CDATA[题目Prove that the following problem is NP-complete: given an undirected graph G = (V, E) and an integer k, return a clique of size k as weill as an independent set of size k, provided both exist.问题解答这个问]]></description><category></category></item><item><title><![CDATA[算法设计期末作业04-8.12]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/75076437</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/75076437</guid><author>lisa___33</author><pubDate>Thu, 13 Jul 2017 16:26:50 +0800</pubDate><description><![CDATA[题目The k-SPANNING TREE problem is the following. 
                            Input: An undirected graph G = (V,E) 
                           Output: Aspanningtreeof G in which each node has degree≤ k,]]></description><category></category></item><item><title><![CDATA[算法设计期末作业03-8.10]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/74989835</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/74989835</guid><author>lisa___33</author><pubDate>Tue, 11 Jul 2017 17:18:56 +0800</pubDate><description><![CDATA[题目Proving NP-completeness by generalization. For each of the problems below, prove that it is NP-complete by showing that it is a generalization of some NP-complete problem we have seen in this chapter]]></description><category></category></item><item><title><![CDATA[算法设计期末作业02-8.8]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/74979694</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/74979694</guid><author>lisa___33</author><pubDate>Tue, 11 Jul 2017 15:57:47 +0800</pubDate><description><![CDATA[题目：In theEXACT4SATproblem, the input is a set of clauses, each of which is a disjunction of exactly 
four literals, and such that each variable occurs at most once in each clause. The goal is to find]]></description><category></category></item><item><title><![CDATA[算法设计期末作业01-8.3]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/74979548</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/74979548</guid><author>lisa___33</author><pubDate>Tue, 11 Jul 2017 15:56:27 +0800</pubDate><description><![CDATA[题目STINGY SAT is the following problem: given a set of clauses(each a disjunction of literals) ans an integer k, find a satisfying assignment in which at most k variables are true, if such an assignment]]></description><category></category></item><item><title><![CDATA[199. Binary Tree Right Side View]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/73863969</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/73863969</guid><author>lisa___33</author><pubDate>Wed, 28 Jun 2017 21:01:53 +0800</pubDate><description><![CDATA[Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example: 
Given the following binary tree, 
   1]]></description><category></category></item><item><title><![CDATA[452. Minimum Number of Arrows to Burst Balloons]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/73852609</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/73852609</guid><author>lisa___33</author><pubDate>Wed, 28 Jun 2017 17:39:18 +0800</pubDate><description><![CDATA[There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizontal, y-coordina]]></description><category></category></item><item><title><![CDATA[455. Assign Cookies]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/73850420</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/73850420</guid><author>lisa___33</author><pubDate>Wed, 28 Jun 2017 16:59:27 +0800</pubDate><description><![CDATA[Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cook]]></description><category></category></item><item><title><![CDATA[547. Friend Circles]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/73849097</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/73849097</guid><author>lisa___33</author><pubDate>Wed, 28 Jun 2017 15:52:38 +0800</pubDate><description><![CDATA[There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, then A]]></description><category></category></item><item><title><![CDATA[104. Maximum Depth of Binary Tree]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/73845158</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/73845158</guid><author>lisa___33</author><pubDate>Wed, 28 Jun 2017 15:04:09 +0800</pubDate><description><![CDATA[Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 
采用递归的算法，同时每次只要为比较大的一边+1就好了。 
代码如下：
/**
 *]]></description><category></category></item><item><title><![CDATA[108. Convert Sorted Array to Binary Search Tree]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/73844591</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/73844591</guid><author>lisa___33</author><pubDate>Wed, 28 Jun 2017 14:48:44 +0800</pubDate><description><![CDATA[Given an array where elements are sorted in ascending order, convert it to a height balanced BST.这道题用dfs去做。代码如下： 
注意TreeNode *root=new TreeNode(nums[mid])往root中加数 
代码如下： 
    /** 
 * Definition for a b]]></description><category></category></item><item><title><![CDATA[486. Predict the Winner]]></title><link>https://blog.youkuaiyun.com/lisa___33/article/details/73649558</link><guid>https://blog.youkuaiyun.com/lisa___33/article/details/73649558</guid><author>lisa___33</author><pubDate>Fri, 23 Jun 2017 16:27:35 +0800</pubDate><description><![CDATA[Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a]]></description><category></category></item></channel></rss>