<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cc_cc_cc_cc_cc_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; cc_cc_cc_cc_cc_]]></copyright><item><title><![CDATA[Fight Monsters]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104179715</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104179715</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Wed, 05 Feb 2020 11:07:23 +0800</pubDate><description><![CDATA[题目
https://codeforces.com/problemset/problem/1296/D
大神解法：
将h[i]设置为还要额外加打的次数，比如怪14血，我攻击力2，队友攻击力3，那么取模后还剩4血，我再来一招，剩2血，这是正常打法，无需用技能换顺序，之和若再按正常打法则被队友打死，但又可能会因为需要加打的次数太多而不确定是否放技能，所以将额外加打次数存下，为1.
然后对加打次数排序，...]]></description><category></category></item><item><title><![CDATA[Food Buying]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104179333</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104179333</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Wed, 05 Feb 2020 10:46:12 +0800</pubDate><description><![CDATA[题目
https://codeforces.com/problemset/problem/1296/B
买10送1
比如你有141元
先买140，送14
剩14+1=15
于是等价于15能买多少，形成递归
#include&lt;bits/stdc++.h&gt;

using namespace std;

#define ll long long

int main()
{
	ll t;
	c...]]></description><category></category></item><item><title><![CDATA[Array Sharpening]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104154084</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104154084</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Mon, 03 Feb 2020 12:03:24 +0800</pubDate><description><![CDATA[题目链接
https://codeforces.com/contest/1291/problem/B
最小为0，且相邻不重复，只能减不能加
从左往右，第一个数最小是0，第二个数最小是1…
将满足的dpl[i]令为true，直到第一个不满足跳出
从右往右，第一个数最小是0，第二个数最小是1…
后面同理
若存在i，使得dpl[i]==true&amp;&amp;dpr[i]==true,则有峰
#in...]]></description><category></category></item><item><title><![CDATA[地下城游戏--逆动态规划--LeetCode.174]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104138263</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104138263</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Sat, 01 Feb 2020 20:52:07 +0800</pubDate><description><![CDATA[class Solution {
public:
    int calculateMinimumHP(vector&lt;vector&lt;int&gt;&gt;&amp; dungeon) {
        int row=dungeon.size();
        if(row==0)return 0;
        int col=dungeon[0].size();
     ...]]></description><category></category></item><item><title><![CDATA[逆波兰表达式的求值]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104128302</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104128302</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Fri, 31 Jan 2020 21:22:55 +0800</pubDate><description><![CDATA[class Solution {
public:
    int evalRPN(vector&lt;string&gt;&amp; tokens) {
        stack&lt;int&gt;nums;
        queue&lt;char&gt;op;
        int size=tokens.size();
        int i=0;
        while(i...]]></description><category></category></item><item><title><![CDATA[链表的归并排序]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104127665</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104127665</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Fri, 31 Jan 2020 20:23:58 +0800</pubDate><description><![CDATA[class Solution {
public:
    ListNode* sortList(ListNode* head) {
        if(!head||!head-&gt;next)return head;
        return mergeSort(head);
    }
    ListNode*mergeSort(ListNode* head){
        if...]]></description><category></category></item><item><title><![CDATA[LeetCode 143：重排链表]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104116349</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104116349</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Thu, 30 Jan 2020 16:41:58 +0800</pubDate><description><![CDATA[找到中点，反转后一半，合并前后
class Solution {
public:
    void reorderList(ListNode* head) {
        if(head==nullptr||head-&gt;next==nullptr){
            return;
        }
        ListNode* slow=head;
        L...]]></description><category></category></item><item><title><![CDATA[same gcds]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104114164</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104114164</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Thu, 30 Jan 2020 12:49:10 +0800</pubDate><description><![CDATA[给m,n
找出满足gcd(m,n)==gcd(m+x,n)&amp;&amp;x&gt;=0&amp;&amp;m&lt;n的所有整数x的个数
#include&lt;bits/stdc++.h&gt;

using namespace std;

#define ll long long

ll gcd(ll m, ll n) {
	return n % m == 0 ? m : gcd(n %...]]></description><category></category></item><item><title><![CDATA[LeetCode 86: partition list]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104097966</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104097966</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Tue, 28 Jan 2020 10:46:06 +0800</pubDate><description><![CDATA[method 1: 使用两个空头结点记录
 ListNode* partition(ListNode* head, int x) {
       ListNode*before_head=new ListNode(0);
       ListNode*before=before_head;
       ListNode*after_head=new ListNode(0);
       ...]]></description><category></category></item><item><title><![CDATA[反转链表]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104096392</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104096392</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Mon, 27 Jan 2020 22:54:28 +0800</pubDate><description><![CDATA[ListNode* reverseList(ListNode* head) {
        ListNode*pre=NULL;
        ListNode*post=NULL;
        if(!head)return head;
        post=head-&gt;next;
        while(post){
            head-&gt;next...]]></description><category></category></item><item><title><![CDATA[c++二维vector用特定元素排序时sort中cmp的重写]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104092152</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104092152</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Mon, 27 Jan 2020 13:04:52 +0800</pubDate><description><![CDATA[Method 1：
class Solution {
    public:
    vector&lt;int&gt; filterRestaurants(vector&lt;vector&lt;int&gt;&gt;&amp; restaurants, int veganFriendly, int maxPrice, int maxDistance) {
        int size=...]]></description><category></category></item><item><title><![CDATA[collecting packages]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104076324</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/104076324</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Thu, 23 Jan 2020 15:53:25 +0800</pubDate><description><![CDATA[使用map存下每一列的最大值与最小值
合法条件，后一列最小值大于等于前一列最大值
#include&lt;bits/stdc++.h&gt;

using namespace std;

int main() {
	int n;
	cin &gt;&gt; n;
	while (n--) {
		int m;
		cin &gt;&gt; m;
		map&lt;int, vector&lt;i...]]></description><category></category></item><item><title><![CDATA[vs2019赋值问题不报错]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103725999</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103725999</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Fri, 27 Dec 2019 08:43:29 +0800</pubDate><description><![CDATA[int a = 225.0000000000000000000000001;
	cout &lt;&lt; a;
	cout&lt;&lt; typeid(1.0).name();

结果a是225，1.0是double
所以小数默认double，若赋值给float，虽然不会报错，但精度的损失仍是存在的

...]]></description><category></category></item><item><title><![CDATA[leetcode 4Sums]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103707300</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103707300</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Wed, 25 Dec 2019 23:34:02 +0800</pubDate><description><![CDATA[只能说这题绝妙，亦或是我解法较笨
class Solution {

    public List&lt;List&lt;Integer&gt;&gt; fourSum(int[] nums,int target) {
        List&lt;List&lt;Integer&gt;&gt; ans=new ArrayList&lt;&gt;();
        int size=num...]]></description><category></category></item><item><title><![CDATA[HashMap的使用]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103698032</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103698032</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Wed, 25 Dec 2019 14:00:27 +0800</pubDate><description><![CDATA[class Solution {
    public int[] twoSum(int[] nums, int target) {
        HashMap&lt;Integer,Integer&gt; map=new HashMap&lt;&gt;();
        for(int i=0;i&lt;nums.length;i++)
        {
            map...]]></description><category></category></item><item><title><![CDATA[leetcode第55题 跳跃游戏]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103691122</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103691122</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Tue, 24 Dec 2019 22:58:13 +0800</pubDate><description><![CDATA[贪心算法]]></description><category></category></item><item><title><![CDATA[leetcode 第20题 括号生成]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103682382</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103682382</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Tue, 24 Dec 2019 14:23:01 +0800</pubDate><description><![CDATA[回溯算法，排列问题]]></description><category></category></item><item><title><![CDATA[leetcode 15 3sum]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103677074</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103677074</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Tue, 24 Dec 2019 09:22:21 +0800</pubDate><description><![CDATA[两个数且只要一个结果的，2sum那题可以用HashMap
本题3sum，如果要求只要得到一个结果，那么我们可以用一次循环将两数之和存入HashMap，然后找目标数与数组之差
这题此种方法显然不符合要求

通过Arrays中的sort函数对nums排序
每次找一个nums[i]作为目标，用两个指针指向其后数组的两端，从两端向中间逼近，若sum&gt;给定数（本题为0),r–,反之，l++.

此法俗...]]></description><category></category></item><item><title><![CDATA[Java文件的创建与读写]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103672302</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103672302</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Mon, 23 Dec 2019 19:56:32 +0800</pubDate><description><![CDATA[String path="d:/abcde";
		File file=new File(path);
		if(!file.exists())
		{
			try{file.createNewFile();}catch(Exception e) {}
		}
		try{FileOutputStream os=new FileOutputStream(path);
		String s="i ...]]></description><category></category></item><item><title><![CDATA[leetcode121，买股票最佳时机]]></title><link>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103671747</link><guid>https://blog.youkuaiyun.com/cc_cc_cc_cc_cc_/article/details/103671747</guid><author>cc_cc_cc_cc_cc_</author><pubDate>Mon, 23 Dec 2019 19:17:17 +0800</pubDate><description><![CDATA[解题思路
利用一个min存储已读取数据中的最小值，每新加一个数，比较那个数与min的大小，若更小，则令min等于它，否则，让那个数减去min得到一个temp，比较其与max的大小
class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length&lt;2)
        return 0;
  ...]]></description><category></category></item></channel></rss>