{
  "schemaVersion": "0.11.0",
  "canonical": "https://www.pystone.net/notes/algorithm-miscellaneous-notes/",
  "atlas": "https://www.pystone.net/?node=algorithm-miscellaneous-notes#knowledge-atlas",
  "markdown": "https://www.pystone.net/notes/algorithm-miscellaneous-notes.md",
  "context": "https://www.pystone.net/notes/algorithm-miscellaneous-notes.context.json",
  "knowledgeVersion": "224c990773de.5fa8af6e39fa",
  "build": {
    "siteCommit": "224c990773de166d23a886306577dd90379529ce",
    "notesCommit": "5fa8af6e39fa3891d1b9b4832bfa6c4e0ecaaf0a",
    "builtAt": "1970-01-01T00:00:00.000Z",
    "version": "224c990773de.5fa8af6e39fa"
  },
  "id": "note:algorithm-miscellaneous-notes",
  "slug": "algorithm-miscellaneous-notes",
  "title": "零碎算法知识",
  "type": "note",
  "visibility": "public",
  "idStability": "rename-stable",
  "author": {
    "name": "Perrin Yong",
    "profile": "https://www.pystone.net/profile/"
  },
  "publisher": {
    "name": "Perrin Yong",
    "profile": "https://www.pystone.net/profile/"
  },
  "aliases": [],
  "summary": "零碎算法知识 创建时间：2023/7/26 21:37",
  "contentRole": "unspecified",
  "isMoc": false,
  "mocRecognition": "none",
  "generated": false,
  "attribution": "unspecified",
  "domain": "10-计算机、信息技术与工程",
  "tags": [],
  "mocs": [],
  "contentHash": "d3e1fbd2512fcb596f6723da4f874a866a3f68c31d955d9a70b94b2a4e6e36f0",
  "assets": [],
  "headings": [
    {
      "depth": 1,
      "text": "零碎算法知识",
      "anchor": "零碎算法知识",
      "citation": "https://www.pystone.net/notes/algorithm-miscellaneous-notes/#%E9%9B%B6%E7%A2%8E%E7%AE%97%E6%B3%95%E7%9F%A5%E8%AF%86"
    },
    {
      "depth": 2,
      "text": "动态规划",
      "anchor": "动态规划",
      "citation": "https://www.pystone.net/notes/algorithm-miscellaneous-notes/#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92"
    },
    {
      "depth": 2,
      "text": "深搜和剪枝",
      "anchor": "深搜和剪枝",
      "citation": "https://www.pystone.net/notes/algorithm-miscellaneous-notes/#%E6%B7%B1%E6%90%9C%E5%92%8C%E5%89%AA%E6%9E%9D"
    },
    {
      "depth": 2,
      "text": "DFS",
      "anchor": "dfs",
      "citation": "https://www.pystone.net/notes/algorithm-miscellaneous-notes/#dfs"
    },
    {
      "depth": 2,
      "text": "异或的性质",
      "anchor": "异或的性质",
      "citation": "https://www.pystone.net/notes/algorithm-miscellaneous-notes/#%E5%BC%82%E6%88%96%E7%9A%84%E6%80%A7%E8%B4%A8"
    }
  ],
  "claims": [],
  "outgoing": [],
  "incoming": [
    {
      "id": "note:data-algorithms-and-engineering-math",
      "title": "数据算法与工程数学",
      "url": "https://www.pystone.net/notes/data-algorithms-and-engineering-math/",
      "atlas": "https://www.pystone.net/?node=data-algorithms-and-engineering-math#knowledge-atlas",
      "label": "数据算法与工程数学",
      "origin": "explicit",
      "humanReviewed": true,
      "context": "本层中的“零碎算法知识”导航项",
      "citation": "https://www.pystone.net/notes/data-algorithms-and-engineering-math/#%E6%9C%AC%E5%B1%82"
    }
  ],
  "contentMarkdown": "# 零碎算法知识\n> 创建时间：2023/7/26 21:37\n\n## 动态规划\n\n什么是动态规划，动态规划的意义？\nhttps://www.cnblogs.com/caiyishuai/p/9047991.html\nhttps://www.sohu.com/a/206775558_821349\nhttps://www.cnblogs.com/hithongming/p/9229871.html\nhttps://blog.csdn.net/aron_conli/article/details/87877621\n\n## 深搜和剪枝\n\n## DFS\n\n深度优先搜索(下文统称DFS)的精髓在于递归求解问题的思路以及回溯的处理。而针对搜索的过程，又有更为重要的剪枝、优化，必要的剪枝优化(通过对穷举答案方式进行改进)对DFS的顺利执行有着不可或缺的作用。本文章将针对DFS的原理、常见的题型、剪枝优化的思路进行分析。当然，爆搜的题型千千万，不可能一概而论，我会通过具体的题目对几类问题的求解思路进行总结分析，构建基本的思维模型。\n\nref: https://blog.csdn.net/yanweiqi1754989931/article/details/109603384\n\n## 异或的性质\n\n交换律：a ^ b ^ c <=> a ^ c ^ b\n任何数于0异或为任何数 0 ^ n => n\n相同的数异或为0: n ^ n => 0\nvar a = [2,3,2,4,4]\n2 ^ 3 ^ 2 ^ 4 ^ 4等价于 2 ^ 2 ^ 4 ^ 4 ^ 3 => 0 ^ 0 ^3 => 3\n"
}