<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cj423889的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/cj423889</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; cj423889]]></copyright><item><title><![CDATA[DFS专题-【LeetCode】39. Combination Sum]]></title><link>https://blog.csdn.net/cj423889/article/details/81903981</link><guid>https://blog.csdn.net/cj423889/article/details/81903981</guid><author>cj423889</author><pubDate>Tue, 21 Aug 2018 12:18:07 +0800</pubDate><description><![CDATA[排列组合类的题目是DFS的一个比较经典的案例。

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to...]]></description><category></category></item><item><title><![CDATA[DFS专题--【LeetCode】17. Letter Combinations of a Phone Number]]></title><link>https://blog.csdn.net/cj423889/article/details/81903790</link><guid>https://blog.csdn.net/cj423889/article/details/81903790</guid><author>cj423889</author><pubDate>Tue, 21 Aug 2018 10:59:13 +0800</pubDate><description><![CDATA[ 

Input:Digit string &quot;23&quot;
Output: [&quot;ad&quot;, &quot;ae&quot;, &quot;af&quot;, &quot;bd&quot;, &quot;be&quot;, &quot;bf&quot;, &quot;cd&quot;, &quot;ce&quot;, &quot;cf&quot;].

中心思想：找出input digit string对应的数字的全部集合。本质就是若干for循环。

dfs类题目，可以把要输出的]]></description><category></category></item><item><title><![CDATA[【leetcode】Anagrams]]></title><link>https://blog.csdn.net/cj423889/article/details/47174979</link><guid>https://blog.csdn.net/cj423889/article/details/47174979</guid><author>cj423889</author><pubDate>Fri, 31 Jul 2015 20:18:23 +0800</pubDate><description><![CDATA[class Solution {
public:
       
       string sortedString(string &str){
           int count[26];
           string sortedStr = "";
           for(int i = 0; i < 26; i++){
               count[i] = ]]></description><category></category></item><item><title><![CDATA[【leetcode】Rotate List]]></title><link>https://blog.csdn.net/cj423889/article/details/47172083</link><guid>https://blog.csdn.net/cj423889/article/details/47172083</guid><author>cj423889</author><pubDate>Fri, 31 Jul 2015 16:35:04 +0800</pubDate><description><![CDATA[class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if(head == NULL) return head;
        ListNode *p = head;
        int len = 0;
        while(p->next){
            p]]></description><category></category></item><item><title><![CDATA[【leetcode】Sort Colors]]></title><link>https://blog.csdn.net/cj423889/article/details/47171271</link><guid>https://blog.csdn.net/cj423889/article/details/47171271</guid><author>cj423889</author><pubDate>Fri, 31 Jul 2015 15:49:44 +0800</pubDate><description><![CDATA[class Solution {
public:
    void sortColors(vector& nums) {
        int count[3] ={0, 0, 0};
        int element = 0;
        for(int i = 0; i < nums.size(); i++){
            count[nums[i]]++;
     ]]></description><category></category></item><item><title><![CDATA[【leetcode】Minimum Size Subarray Sum]]></title><link>https://blog.csdn.net/cj423889/article/details/47170139</link><guid>https://blog.csdn.net/cj423889/article/details/47170139</guid><author>cj423889</author><pubDate>Fri, 31 Jul 2015 14:58:05 +0800</pubDate><description><![CDATA[以上是AC代码
主要思路还是应用双指针 start 和 end
1. 固定start 移动end 找到第一个满足大于等于s的长度
2. 试着删除开始的几个元素，直到不满足s
3. 如果2没有全部之前所存储的满足s的元素， 则继续加上end指针的指向的后面的元素
4.循环2和3过程直到遍历了所有元素]]></description><category></category></item><item><title><![CDATA[【leetcode】Linked List Cycle]]></title><link>https://blog.csdn.net/cj423889/article/details/47154839</link><guid>https://blog.csdn.net/cj423889/article/details/47154839</guid><author>cj423889</author><pubDate>Thu, 30 Jul 2015 19:32:03 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool hasCycle(ListNode *head) {
        if(head == NULL || head->next == NULL) return NULL;
        ListNode *fast = head;
        ListNode *slow = head;
        while(fas]]></description><category></category></item><item><title><![CDATA[【leetcode】Linked List Cycle II]]></title><link>https://blog.csdn.net/cj423889/article/details/47154607</link><guid>https://blog.csdn.net/cj423889/article/details/47154607</guid><author>cj423889</author><pubDate>Thu, 30 Jul 2015 19:12:08 +0800</pubDate><description><![CDATA[class Solution {
public:
    ListNode *detectCycle(ListNode *head) {
        if(head == NULL || head->next == NULL) return NULL;
        
        ListNode *fast = head;
        ListNode *slow = head;]]></description><category></category></item><item><title><![CDATA[【leetcode】Valid Palindrome]]></title><link>https://blog.csdn.net/cj423889/article/details/47154437</link><guid>https://blog.csdn.net/cj423889/article/details/47154437</guid><author>cj423889</author><pubDate>Thu, 30 Jul 2015 18:55:37 +0800</pubDate><description><![CDATA[class Solution {
public:
    bool isCharAndNum(char &c){
        if(c >= '0' && c <= '9') return true;
        if(c >= 'A' && c <= 'Z') {
            c += 32;
            return true;
        }
      ]]></description><category></category></item><item><title><![CDATA[【leetcode】Palindrome Linked List]]></title><link>https://blog.csdn.net/cj423889/article/details/47129579</link><guid>https://blog.csdn.net/cj423889/article/details/47129579</guid><author>cj423889</author><pubDate>Wed, 29 Jul 2015 16:24:46 +0800</pubDate><description><![CDATA[以上是AC代码
主要是方法还是双指针法
两次利用双指针法：
（1），翻转前一半节点
（2），两个指针分别指向头结点和中间节点，以此比较各个节点的值
注意：总结点个数为偶数时的情况]]></description><category></category></item><item><title><![CDATA[【leetcode】Delete Node in a Linked List]]></title><link>https://blog.csdn.net/cj423889/article/details/46911239</link><guid>https://blog.csdn.net/cj423889/article/details/46911239</guid><author>cj423889</author><pubDate>Thu, 16 Jul 2015 14:16:52 +0800</pubDate><description><![CDATA[class Solution {public: void deleteNode(ListNode* node) { if(node == NULL || node->next == NULL) return; ListNode *temp = node->next; node->val = temp->val; node->next = temp->next; free(temp); }};]]></description><category></category></item><item><title><![CDATA[分析AVS2.0与HEVC熵编码相关的算法]]></title><link>https://blog.csdn.net/cj423889/article/details/39677101</link><guid>https://blog.csdn.net/cj423889/article/details/39677101</guid><author>cj423889</author><pubDate>Mon, 29 Sep 2014 22:11:18 +0800</pubDate><description><![CDATA[目前拿到的AVS2.0是RD7.0，在当前的版本中上编码相关的]]></description><category></category></item><item><title><![CDATA[WIN7专业版32/64位更换系统语言注意]]></title><link>https://blog.csdn.net/cj423889/article/details/33750237</link><guid>https://blog.csdn.net/cj423889/article/details/33750237</guid><author>cj423889</author><pubDate>Mon, 23 Jun 2014 19:39:35 +0800</pubDate><description><![CDATA[WIN7中文专业版安装英文语言包的方法  

2013-05-26 11:49:26|  分类： 电脑知识 |  标签：win7  英文语言包  安装 突然决定将操作系统更换成英文版本的，主要是希望能够促进学习英语，在网上查了很多教程，发现大部分都是千篇一律，很多都是针对旗舰版的，对于专业版本等的操作没有好的方法，今天早上经过尝试，终于搞定了，现将方法记录下来，希望对大家有所帮助，具体步骤如下]]></description><category></category></item><item><title><![CDATA[CABAC 学习（1）二值化（Binarization）过程分析]]></title><link>https://blog.csdn.net/cj423889/article/details/31368255</link><guid>https://blog.csdn.net/cj423889/article/details/31368255</guid><author>cj423889</author><pubDate>Mon, 16 Jun 2014 12:55:01 +0800</pubDate><description><![CDATA[以前有人问我，为什么用一种特定]]></description><category></category></item><item><title><![CDATA[CABAC 学习（4）概率更新模型分析]]></title><link>https://blog.csdn.net/cj423889/article/details/31364143</link><guid>https://blog.csdn.net/cj423889/article/details/31364143</guid><author>cj423889</author><pubDate>Mon, 16 Jun 2014 12:34:19 +0800</pubDate><description><![CDATA[CABAC- context-based adaptive binary arithmetic coding]]></description><category></category></item><item><title><![CDATA[残差信号编码(residual coding) 和CABAC 中TU-level 的上下文parsing 代码分析]]></title><link>https://blog.csdn.net/cj423889/article/details/31351909</link><guid>https://blog.csdn.net/cj423889/article/details/31351909</guid><author>cj423889</author><pubDate>Mon, 16 Jun 2014 10:54:52 +0800</pubDate><description><![CDATA[CABAC 是唯一一个应用到HEVC中的熵编码方式，]]></description><category></category></item><item><title><![CDATA[_manifest.rc(1): error RC2135: file not found:。。。问题解决]]></title><link>https://blog.csdn.net/cj423889/article/details/19341439</link><guid>https://blog.csdn.net/cj423889/article/details/19341439</guid><author>cj423889</author><pubDate>Mon, 17 Feb 2014 16:45:28 +0800</pubDate><description><![CDATA[VC2010运行HEVC software reference HM code 时， 出现_manifest.rc(1): error RC2135: file not found:
查了半天资料，下面提供一种解决方法：
双击VC2010输出窗口的error提示，会出现下面_manifest.rc窗口：
1 /* CREATEPROCESS_MANIFEST_RESOURCE_ID */ 2]]></description><category></category></item><item><title><![CDATA[打算从今天开始写一写视频标准HEVC HM代码的学习的总结了]]></title><link>https://blog.csdn.net/cj423889/article/details/13507459</link><guid>https://blog.csdn.net/cj423889/article/details/13507459</guid><author>cj423889</author><pubDate>Tue, 29 Oct 2013 14:21:50 +0800</pubDate><description><![CDATA[由于之前没有写过C程序，现在读研了，发现要学的东西全是要用C++，算法之类的东西，不学没有办法了。
还要兼顾硬件逻辑语言。。。。开始真的好难。所以借以此博客作为开始。
关于HEVC
前一段研究明白了熵编码CABAC部分。
改了一部分代码。
然后学习了国内的视频标准AVS的熵编码部分代码。
因为AVS很少人研究，只能看标准和RM代码，花了很多时间，尤其在代码不是熟悉的情况下。
详细的内]]></description><category></category></item></channel></rss>