<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[BoyInC0de的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/BoyInC0de</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; BoyInC0de]]></copyright><item><title><![CDATA[Ubuntu 18.04.6 Android Studio Giraffe adb logcat 无法使用]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/132280936</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/132280936</guid><author>BoyInC0de</author><pubDate>Mon, 14 Aug 2023 17:53:06 +0800</pubDate><description><![CDATA[建议通过 update-alternatives 使用 android studio 里面 Tools -> sdk manager -> SDK Tools -> Android SDK Platform-Tools 的最新版。Android Studio 下面 logcat 标签页，设备选择框显示 "no connected devices"，但却可以正常安装 app，就是没 log。然后操作一下 update-alternatives，使用新版的，再重启 Android Studio 即可。]]></description><category></category></item><item><title><![CDATA[typescript, javascript, 字符串固定位置插入字符]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/120869257</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/120869257</guid><author>BoyInC0de</author><pubDate>Wed, 20 Oct 2021 16:37:48 +0800</pubDate><description><![CDATA[js和ts里连个字符串插入方法都没有，难受！

这个参考了python中index可以是负数从后向前数的思想，自己写了一个。


console.clear();

function insertStr(src:string, pos:number, val:string):string{
    if(pos &lt; -src.length-1 || pos &gt; src.length) throw "insert position is error";
    if(pos &gt;= 0)
  ]]></description><category></category></item><item><title><![CDATA[opencv报错 断言 __acrt_first_block == header]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/120430552</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/120430552</guid><author>BoyInC0de</author><pubDate>Thu, 23 Sep 2021 10:59:35 +0800</pubDate><description><![CDATA[问题描述

在一个使用opencv的项目里，把MDD改成了MTD之后，Debug模式遇到了错误。

debug_heap.cpp第996行


        if (header-&gt;_block_header_prev)
        {
            header-&gt;_block_header_prev-&gt;_block_header_next = header-&gt;_block_header_next;
        }
        else
       ...]]></description><category></category></item><item><title><![CDATA[C++分析产品功能数据生成markdown表格代码]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/120366496</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/120366496</guid><author>BoyInC0de</author><pubDate>Sat, 18 Sep 2021 14:33:09 +0800</pubDate><description><![CDATA[代码功能描述:

将各自产品支持的各自功能或特性汇总成一张2维大表.参考下面的输入输出样例.

源代码


#include &lt;iostream&gt;
#include &lt;string&gt;
#include &lt;vector&gt;
#include &lt;map&gt;
#include &lt;algorithm&gt;

using namespace std;

typedef string TYPE;
typedef string ITEM;
int main()
{
	.]]></description><category></category></item><item><title><![CDATA[[PAT] 2020年春季赛题目 完整题目 + 完整答案 + 个人总结]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107585775</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107585775</guid><author>BoyInC0de</author><pubDate>Sat, 25 Jul 2020 22:49:06 +0800</pubDate><description><![CDATA[[PAT] 2020年春季赛题目 完整题目

这次比赛在2020/07/25日举行, 距离比赛截止前5分钟.

100分的人数有: 86人

90分到99分的有: 142人


7-1 Prime Day (20分)

The above picture is from Sina Weibo, showing May 23rd, 2019 as a very cool "Prime Day". That is, not only that the corresponding number of the d.]]></description><category></category></item><item><title><![CDATA[算法笔记 栈 中缀转后缀表达式 codeup 1918 简单计算器]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107287495</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107287495</guid><author>BoyInC0de</author><pubDate>Sat, 11 Jul 2020 17:02:51 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;string&gt;
#include &lt;stack&gt;
#include &lt;queue&gt;
#include &lt;map&gt;

using namespace std;

struct node{
    double num; //操作数
    char op;    //操作符
    bool flag;  //true表示操作数, false表示操作符
};

string str;
st.]]></description><category></category></item><item><title><![CDATA[1039 Course List for Student  使用map超时, unordered_map能过]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107268194</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107268194</guid><author>BoyInC0de</author><pubDate>Fri, 10 Jul 2020 21:11:04 +0800</pubDate><description><![CDATA[1039 Course List for Student

使用map超时, unordered_map是能够通过的.

在unordered_map下使用str.resize(4); scanf("%s", &amp;str[0]);



在unordered_map下使用cin&gt;&gt;str的时间:



正确代码:


#include &lt;iostream&gt;
#include &lt;unordered_map&gt;
#include &lt;vector&gt;
#inc..]]></description><category></category></item><item><title><![CDATA[1096 Consecutive Factors 样例三 测试点三 无法通过]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107251793</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107251793</guid><author>BoyInC0de</author><pubDate>Fri, 10 Jul 2020 15:32:58 +0800</pubDate><description><![CDATA[1096Consecutive Factors(20分)

Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3×5×6×7, where 5, 6, and 7 are the three consecutive numbers. Now given any positive N, you are ..]]></description><category></category></item><item><title><![CDATA[PAT乙级 1049 数列的片段和 (20分) PAT甲级 1104 Sum of Number Segments (20分)]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107210646</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107210646</guid><author>BoyInC0de</author><pubDate>Wed, 08 Jul 2020 17:34:45 +0800</pubDate><description><![CDATA[我过不了啊....

还是萌新的我怎么也想不到还会有精度问题....
————————————————
版权声明：本文为优快云博主「冰释的温存」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。
原文链接：https://blog.youkuaiyun.com/qq_21394327/article/details/106975016



1049 数列的片段和 (20分)

给定一个正数数列，我们可以从中截取任意的连续的几个数，称为片段。例如，给定数列 { 0.1, 0.2, 0.]]></description><category></category></item><item><title><![CDATA[B1019/A1069 数字黑洞 借用string, algorithm快速完成]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107209472</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107209472</guid><author>BoyInC0de</author><pubDate>Wed, 08 Jul 2020 16:47:28 +0800</pubDate><description><![CDATA[通过大量库函数快速完成此题.

比如 sort对字符串排序

string.length()来对不足4位的数字补0

to_string()将string快速转为int

(还有个astox函数可以实现string.c_str()快速转数字)

掌握一些库函数有利于快速做题


#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;string&gt;

using namespace std;

int str2num(stri]]></description><category></category></item><item><title><![CDATA[1067 Sort with Swap(0, i) 使用Map 36行 短代码]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107050759</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107050759</guid><author>BoyInC0de</author><pubDate>Tue, 30 Jun 2020 21:17:33 +0800</pubDate><description><![CDATA[和PAT书上的思路不一样。我使用了map，费内存是真的。但是换来了运行时间。



使用map的思路是这样的。

原来用数组，下标里面存值。

用map则是key是值，value是原来数组的下标，即map&lt;值，下标&gt;

这样就O(1)访问了。


#include&lt;map&gt;
#include&lt;iostream&gt;
#include&lt;algorithm&gt;
using namespace std;
int main(){
    int n;
    scanf("]]></description><category></category></item><item><title><![CDATA[简单易懂 PAT 1033 To Fill or Not to Fill 贪心算法]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/107013866</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/107013866</guid><author>BoyInC0de</author><pubDate>Mon, 29 Jun 2020 09:48:25 +0800</pubDate><description><![CDATA[取消注释， 看跑路过程！



贪心思路：

1. 优先前往油价比当前油价更低的油站，为了前往这个油站，油箱里的油要加最少（即跑到下一站油量恰好为0），为了能去那里加更便宜的油

2. 没有比当前油价低的油站时，则在能跑到的油站里寻找价格最低的油站，但是这个最低的油站也比当前油站的价格高，所以要在当前油站把油加满。

3. 如果满油都到不了任意一个油站，那就说明到不了目的地，最远到达当前油站坐标+满油箱能跑的距离




#include &lt;iostream&gt;
#include &lt;al..]]></description><category></category></item><item><title><![CDATA[已安装 VS2019 Qt MSVC2017 编译器]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/105915991</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/105915991</guid><author>BoyInC0de</author><pubDate>Mon, 04 May 2020 12:37:39 +0800</pubDate><description><![CDATA[很多答案说的是安装VS2017, 然后再装qt. 就会自动侦测到.

但是已安装VS2019的话, 还要再卸载掉吗?

VS2019 某一版本更新, 用一个.bat文件来管理使用不同版本的编译器.

我也是试出来的这么个方法, 如果你有明确的做法, 也可以评论给我.



当然也是我的知乎账号, 所以声明了原创!

觉得有效, 可以给我的知乎答案或者csdn点个赞.



知乎

https:...]]></description><category></category></item><item><title><![CDATA[PAT 1016 Phone Bills 简单易懂 C++]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/105915757</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/105915757</guid><author>BoyInC0de</author><pubDate>Mon, 04 May 2020 12:13:12 +0800</pubDate><description><![CDATA[1016Phone Bills

代码简单易懂. 觉得算法笔记书上的代码过于复杂了.


#define _CRT_SECURE_NO_WARNINGS
#include &lt;iostream&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
struct Cus{
  char name[21];
  int month;...]]></description><category></category></item><item><title><![CDATA[assimp cmake 出错 无法解析的外部符号]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/105247897</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/105247897</guid><author>BoyInC0de</author><pubDate>Wed, 01 Apr 2020 20:10:43 +0800</pubDate><description><![CDATA[编译选项加上这个:





我错误的原因应该是

调用了anaconda里面的库 z.lib
]]></description><category></category></item><item><title><![CDATA[codeup 1817 Problem B A+B]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/103651749</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/103651749</guid><author>BoyInC0de</author><pubDate>Sun, 22 Dec 2019 11:28:01 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS
#include &lt;stdio.h&gt;
int main(){
    char ch1;
    int i=0;
    int a[2]={0,0};
    int flag[2]={1,1};
    int enterflag = 0;
    while(scanf("%c",&amp;ch...]]></description><category></category></item><item><title><![CDATA[QA-常见问题-配置相关]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/103501666</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/103501666</guid><author>BoyInC0de</author><pubDate>Thu, 12 Dec 2019 00:21:59 +0800</pubDate><description><![CDATA[gVim的文件问题 . ~  .un~

https://blog.youkuaiyun.com/qq_37744360/article/details/89395933
]]></description><category></category></item><item><title><![CDATA[PAT 1009 说反话]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/98777981</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/98777981</guid><author>BoyInC0de</author><pubDate>Wed, 07 Aug 2019 19:43:57 +0800</pubDate><description><![CDATA[这个题目 要说怎么写呢? 肯定不能采用暴力解法, 因为太难了不是......

这个题目是对上一道题目(https://blog.youkuaiyun.com/BoyInC0de/article/details/98759557)算法的有力补充!!!!

习得:

C++ 字符串的结尾不是'\0' !!!! (一开始一直死循环, 跳不出while循环)

如果需要, 使用String.size()来控制


...]]></description><category></category></item><item><title><![CDATA[PAT-1008-数组元素循环右移问题]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/98759557</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/98759557</guid><author>BoyInC0de</author><pubDate>Wed, 07 Aug 2019 16:40:35 +0800</pubDate><description><![CDATA[先po上我的代码:

实现一位移位, 然后循环疑问, 时间复杂度是(M*N)的, 近似于N^2吧.......

即使是我的代码打印那里也是抄袭了人家的/xk


#include &lt;iostream&gt;

using namespace std;

int main()
{
    int N;
    cin &gt;&gt; N;
    int num[N];
    int M...]]></description><category></category></item><item><title><![CDATA[PAT-1003-我要通过]]></title><link>https://blog.youkuaiyun.com/BoyInC0de/article/details/98657859</link><guid>https://blog.youkuaiyun.com/BoyInC0de/article/details/98657859</guid><author>BoyInC0de</author><pubDate>Tue, 06 Aug 2019 20:51:44 +0800</pubDate><description><![CDATA[7-8月是我的低产期.

7月份上旬小学期学习JAVA做网站, 7月下旬和8月上旬开始刷书 C++ primer 第五版.

发现原来所谓上课讲的C++真的离真正的C++差远了!!!

毕竟原来那本书叫 C++面向对象编程.... 而自己一直在用C++写C的语法..

所以接下来的程序就会尽可能的参考C++ primer按照C++的思想和语法习惯来编程~

争取8-31能考出PAT证书来!!!!
...]]></description><category></category></item></channel></rss>