{
  "version": "https://jsonfeed.org/version/1.1",
  "title": "Algorithm on 不靠谱颜论",
  "home_page_url": "https://yanlinlin.cn/tags/algorithm/",
  "feed_url": "https://yanlinlin.cn/tags/algorithm/feed.json",
  "description": "颜林林博士的个人主页 - 生物信息学专家、精准医疗研究者、AI/LLM应用探索者。20多年编程经验，专注高通量组学数据分析、临床肿瘤基因检测、大模型在生物信息学领域的应用。分享技术探索、学术思考、生活感悟，记录那些“不靠谱”却有趣的发现。",
  "icon": "https://yanlinlin.cn/images/og-image.jpg",
  "favicon": "https://yanlinlin.cn/favicon.ico",
  "language": "zh-CN",
  "authors": [
    {
      "name": "颜林林",
      "url": "https://yanlinlin.cn/"
    }
  ],
  "items": [
    {
      "id": "https://yanlinlin.cn/2020/01/28/recording-a-leetcode-problem-solving-087-scramble-string/",
      "url": "https://yanlinlin.cn/2020/01/28/recording-a-leetcode-problem-solving-087-scramble-string/",
      "title": "记一次LeetCode解题（087-扰乱字符串）",
      "summary": "力扣第 87 题扰乱字符串改了五版才过：先按字符位置映射，再补上重复字符与字符集齐全的判断，最后用指针替代 substr、加 256 计数数组预裁，跑到 4 ms。","content_text": "力扣第 87 题扰乱字符串改了五版才过：先按字符位置映射，再补上重复字符与字符集齐全的判断，最后用指针替代 substr、加 256 计数数组预裁，跑到 4 ms。",
      "image": "https://yanlinlin.cn/uploads/2020/0128/leetcode.png",
      "date_published": "2020-01-28T08:00:27+08:00",
      "tags": ["leetcode","algorithm","递归","编程"],
      "authors": [
        {
          "name": "颜林林"
        }
      ]
    },
    {
      "id": "https://yanlinlin.cn/2020/01/27/implementation-of-expression-parsing/",
      "url": "https://yanlinlin.cn/2020/01/27/implementation-of-expression-parsing/",
      "title": "表达式解析的实现",
      "summary": "二宝出生又赶上疫情宅家，零碎时间全拿来写表达式求值。对比间接递归与经典堆栈两条路：后者按优先级把中缀转成后缀再求值，扩展到更多运算符时更省事。","content_text": "二宝出生又赶上疫情宅家，零碎时间全拿来写表达式求值。对比间接递归与经典堆栈两条路：后者按优先级把中缀转成后缀再求值，扩展到更多运算符时更省事。",
      "date_published": "2020-01-27T20:13:06+08:00",
      "tags": ["algorithm","eval-exp","infix","postfix"],
      "authors": [
        {
          "name": "颜林林"
        }
      ]
    }
  ]
}
