<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ChenD17的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ChenD17</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ChenD17]]></copyright><item><title><![CDATA[-----]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/133079048</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/133079048</guid><author>ChenD17</author><pubDate>Wed, 03 Jul 2024 13:43:59 +0800</pubDate><description><![CDATA[想到一个人害怕知了，打电话给她，我在福州哭，她在莆田哭；也想到近很多的事情，想到我唯一一次也是最后一次，给了她两千块钱，她很高兴；想到她老问我能赚多少钱，有没有三千块钱，我说有啊有啊，她问我有没有更多，够不够吃饭；想到她后面突然会不记得突突，但是问她，记不记得cjy，她说cjy肯定记得的；想到她在我很小的时候说，小娃娃要抱到什么时候呀，抱去上大学，抱到结婚的时候，我当时说，长大了就不抱了。小时候想要的工作，现在早就获取了，轻松的氛围，decent的收入，那时候的烦恼和担忧，现在早就解决了。]]></description><category></category></item><item><title><![CDATA[huawei1-0]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/107711078</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/107711078</guid><author>ChenD17</author><pubDate>Fri, 31 Jul 2020 13:00:48 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include&lt;string&gt;
#include&lt;algorithm&gt;
using namespace std;

int main() {
 int begin, total;
 string input;
 getline(cin, input);
 cin &gt;&gt; begin&gt;&gt;total...]]></description><category></category></item><item><title><![CDATA[leetcode-718-最长重复子数组]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/107066352</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/107066352</guid><author>ChenD17</author><pubDate>Wed, 01 Jul 2020 16:20:58 +0800</pubDate><description><![CDATA[classSolution{

public:

intfindLength(vector&lt;int&gt;&amp;A,vector&lt;int&gt;&amp;B){

intres=0;

if(A.size()==0||B.size()==0)return0;

vector&lt;vector&lt;int&gt;&gt;dp(A.size(),vector&lt;int&gt;(B.siz...]]></description><category></category></item><item><title><![CDATA[leetcode-345-反转字符串中的元音字母]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103300778</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103300778</guid><author>ChenD17</author><pubDate>Wed, 01 Jul 2020 16:19:41 +0800</pubDate><description><![CDATA[bool helper(char ch) {
 if ((ch == 'a') ||
  (ch == 'e') ||
  (ch == 'i') ||
  (ch == 'o') ||
  (ch == 'u') ||
  (ch == 'A') ||
  (ch == 'E') ||
  (ch ==...]]></description><category></category></item><item><title><![CDATA[leetcode-92-反转链表II]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/104102085</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/104102085</guid><author>ChenD17</author><pubDate>Wed, 01 Jul 2020 16:19:03 +0800</pubDate><description><![CDATA[/**

*Definitionforsingly-linkedlist.

*structListNode{

*intval;

*ListNode*next;

*ListNode(intx):val(x),next(NULL){}

*};

*/

classSolution{

public:

...]]></description><category></category></item><item><title><![CDATA[leetcode-242-有效的字母异位词]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103619333</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103619333</guid><author>ChenD17</author><pubDate>Wed, 01 Jul 2020 16:18:50 +0800</pubDate><description><![CDATA[classSolution{

public:

boolisAnagram(strings,stringt){

if(s.length()!=t.length())returnfalse;

intN=s.length();

map&lt;char,int&gt;freq_t,freq_s;

...]]></description><category></category></item><item><title><![CDATA[leetcode-215-数组中的第K个最大元素]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103281505</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103281505</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:48:06 +0800</pubDate><description><![CDATA[//快排辅助

class Solution {
public:
 int findKthLargest(vector&lt;int&gt;&amp; nums, int k) {
  k = nums.size() - k +1;
  int pos, left = 0, right = nums.size() - 1;
  pos = QuickS...]]></description><category></category></item><item><title><![CDATA[leetcode-16-最接近的三数之和]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103894506</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103894506</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:47:56 +0800</pubDate><description><![CDATA[//最前面多加一句判断（是否个数为3个），从超过59%升为超过99%，无语

classSolution{

public:

intthreeSumClosest(vector&lt;int&gt;&amp;nums,inttarget){

if(nums.size()==3)returnnums[0]+nums[1]+nums[2];

...]]></description><category></category></item><item><title><![CDATA[leetcode-82-删除排序链表中的重复元素 II]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/104238898</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/104238898</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:47:48 +0800</pubDate><description><![CDATA[//不加伪头结点可能可以更快，注意new了就要删，指针不指了就要删

class Solution {
public:
 ListNode* deleteDuplicates(ListNode* head) {
  ListNode* temp = new ListNode(0);
  temp-&gt;next = head;
  ListNode*...]]></description><category></category></item><item><title><![CDATA[leetcode-102-二叉树的层次遍历]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/104256525</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/104256525</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:47:40 +0800</pubDate><description><![CDATA[classSolution{

public:

vector&lt;vector&lt;int&gt;&gt;levelOrder(TreeNode*root){

vector&lt;vector&lt;int&gt;&gt;res={};

TreeNode*curNode=root;

queue&lt;pair...]]></description><category></category></item><item><title><![CDATA[leetcode-26-删除排序数组中的重复项]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/100581592</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/100581592</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:47:19 +0800</pubDate><description><![CDATA[class Solution {
public:
 int removeDuplicates(vector&lt;int&gt;&amp; nums) {
  int left = 0, right = 1, N = nums.size();
    if (N == 0) return 0;
  for (; right &lt; N; right++)...]]></description><category></category></item><item><title><![CDATA[leetcode-171-excel表序列号]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/100564859</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/100564859</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:47:12 +0800</pubDate><description><![CDATA[class Solution {
public:
 int letters2nums(char c) {
  return int(c - 64);
 }
 int titleToNumber(string s) {
  int N = s.length(), res=0, temp, power;
  for (int i = N - 1...]]></description><category></category></item><item><title><![CDATA[leetcode-714-买卖股票的最佳时间]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/100547800</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/100547800</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:47:04 +0800</pubDate><description><![CDATA[//未AC，19/44，超时



#include&lt;stdio.h&gt;
#include&lt;math.h&gt;
#include&lt;vector&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;algorithm&gt;

using namespace std;

class Solution ...]]></description><category></category></item><item><title><![CDATA[leetcode-75-颜色分类]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103275411</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103275411</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:46:49 +0800</pubDate><description><![CDATA[//1. 两次遍历

classSolution{

public:

voidsortColors(vector&lt;int&gt;&amp;nums){

intN=nums.size(),cnt0=0,cnt1=0,cnt2=0;

for(inti=0;i&lt;N;i++){

...]]></description><category></category></item><item><title><![CDATA[leetcode-88-合并两个有序数组]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103280481</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103280481</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:46:40 +0800</pubDate><description><![CDATA[//原地插入，没有另外开辟空间，插入使用vector的insert

classSolution{

public:

voidmerge(vector&lt;int&gt;&amp;nums1,intm,vector&lt;int&gt;&amp;nums2,intn){

intnums1i=0;

for(inti...]]></description><category></category></item><item><title><![CDATA[leetcode-451-根据字符出现频率排序]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103733970</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103733970</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:46:28 +0800</pubDate><description><![CDATA[//有一些字符串的处理，题目大小写敏感

bool cmp(pair&lt;char, int&gt; a, pair&lt;char, int&gt; b) {
 return (a.second &gt; b.second);
}

class Solution {
public:
 string frequencySort(string s) {
  int N ...]]></description><category></category></item><item><title><![CDATA[leetcode-4-寻找两个有序数组的中位数]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103913678</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103913678</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:46:18 +0800</pubDate><description><![CDATA[class Solution {
public:
  double findMedianSortedArrays(vector&lt;int&gt;&amp; nums1, vector&lt;int&gt;&amp; nums2) {
    int N = nums1.size(), M = nums2.size(), cnt=0, n1=0, n2=0;
   ...]]></description><category></category></item><item><title><![CDATA[leetcode-24-两两交换链表中的节点]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/104241069</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/104241069</guid><author>ChenD17</author><pubDate>Sun, 28 Jun 2020 09:45:58 +0800</pubDate><description><![CDATA[class Solution {
public:
 ListNode* swapPairs(ListNode* head) {
  if (head == NULL || head-&gt;next == NULL ) return head;
  ListNode* dumhead = new ListNode(0);
  dumhead-&gt;n...]]></description><category></category></item><item><title><![CDATA[leetcode-67-二进制求和]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/106943652</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/106943652</guid><author>ChenD17</author><pubDate>Wed, 24 Jun 2020 14:45:56 +0800</pubDate><description><![CDATA[classSolution{

public:

stringaddBinary(stringa,stringb){

stringres="";

intflag=0;

if(a.length()&lt;b.length())swap(a,b);

for(inti=0;i&lt;b.length();++i){

intib=b.length()-...]]></description><category></category></item><item><title><![CDATA[leetcode-125-验证回文串]]></title><link>https://blog.youkuaiyun.com/ChenD17/article/details/103300693</link><guid>https://blog.youkuaiyun.com/ChenD17/article/details/103300693</guid><author>ChenD17</author><pubDate>Wed, 24 Jun 2020 14:44:06 +0800</pubDate><description><![CDATA[string char_type(char input) {
 if (input &gt; 47 &amp;&amp; input &lt; 58) return "numbers";
 else if (input &gt; 64 &amp;&amp; input &lt; 91) return "LETTERS";
 else if (input &gt; 96 &am...]]></description><category></category></item></channel></rss>