{"id":1793,"date":"2017-02-18T08:41:05","date_gmt":"2017-02-18T00:41:05","guid":{"rendered":"http:\/\/cn.hostease.com\/xueyuan\/?p=1793"},"modified":"2025-01-07T15:43:41","modified_gmt":"2025-01-07T07:43:41","slug":"%e7%bb%8f%e5%85%b8%e7%ae%97%e6%b3%95%e9%a2%98%e6%af%8f%e6%97%a5%e6%bc%94%e7%bb%83-%e7%ac%ac%e4%b9%9d%e9%a2%98-%e4%bc%98%e5%85%88%e9%98%9f%e5%88%97","status":"publish","type":"post","link":"https:\/\/cn.hostease.com\/xueyuan\/jishu\/%e7%bb%8f%e5%85%b8%e7%ae%97%e6%b3%95%e9%a2%98%e6%af%8f%e6%97%a5%e6%bc%94%e7%bb%83-%e7%ac%ac%e4%b9%9d%e9%a2%98-%e4%bc%98%e5%85%88%e9%98%9f%e5%88%97\/","title":{"rendered":"\u7ecf\u5178\u7b97\u6cd5\u9898\u6bcf\u65e5\u6f14\u7ec3\u2014\u2014\u7b2c\u4e5d\u9898 \u4f18\u5148\u961f\u5217"},"content":{"rendered":"\n

\u4f18\u5148\u961f\u5217\uff0c\u975e\u5806\u83ab\u5c5e\u3002<\/p>\n\n\n\n

\u4e00\uff1a\u5806\u7ed3\u6784<\/p>\n\n\n\n

1:\u6027\u8d28<\/p>\n\n\n\n

\u5806\u662f\u4e00\u79cd\u5f88\u677e\u6563\u7684\u5e8f\u7ed3\u6784\u6811\uff0c\u53ea\u4fdd\u5b58\u4e86\u7236\u8282\u70b9\u548c\u5b69\u5b50\u8282\u70b9\u7684\u5927\u5c0f\u5173\u7cfb\uff0c\u5e76\u4e0d\u89c4\u5b9a\u5de6\u53f3\u5b69\u5b50\u7684\u5927\u5c0f\uff0c\u4e0d\u50cf\u6392\u5e8f\u6811\u90a3\u6837\u4e25\u683c\uff0c\u53c8\u56e0\u4e3a\u5806\u662f\u4e00\u79cd\u5b8c\u5168\u4e8c\u53c9<\/p>\n\n\n\n

\u6811\uff0c\u8bbe\u8282\u70b9\u4e3ai,\u5219i\/2\u662fi\u7684\u7236\u8282\u70b9\uff0c2i\u662fi\u7684\u5de6\u5b69\u5b50\uff0c2i+1\u662fi\u7684\u53f3\u5b69\u5b50\uff0c\u6240\u4ee5\u5728\u5b9e\u73b0\u65b9\u5f0f\u4e0a\u53ef\u4ee5\u91c7\u7528\u8f7b\u91cf\u7ea7\u7684\u6570\u7ec4\u3002<\/p>\n\n\n\n

\"\"<\/a><\/figure>\n\n\n\n

<\/p>\n\n\n\n

2\uff1a\u7528\u9014<\/p>\n\n\n\n

\u5982\u679c\u5927\u5bb6\u73a9\u8fc7\u5fae\u8f6f\u7684MSMQ\u7684\u8bdd\uff0c\u6211\u4eec\u53d1\u73b0\u5b83\u5176\u5b9e\u4e5f\u662f\u4e00\u4e2a\u4f18\u5148\u961f\u5217\uff0c\u8fd8\u6709\u521a\u624d\u8bf4\u7684\u6293\u53d6url\uff0c\u4e0d\u8fc7\u5f88\u9057\u61be\uff0c\u4e3a\u4ec0\u4e48.net\u7c7b\u5e93\u4e2d\u6ca1\u6709\u4f18\u5148\u961f\u5217\uff0c\u800cjava1.5<\/p>\n\n\n\n

\u4e2d\u5c31\u5df2\u7ecf\u652f\u6301\u4e86\u3002<\/p>\n\n\n\n

3\uff1a\u5b9e\u73b0<\/p>\n\n\n\n

<1>\u5806\u7ed3\u6784\u8282\u70b9\u5b9a\u4e49\uff1a<\/p>\n\n\n\n

\u6211\u4eec\u5728\u6bcf\u4e2a\u8282\u70b9\u4e0a\u5b9a\u4e49\u4e00\u4e2alevel\uff0c\u8868\u793a\u8be5\u8282\u70b9\u7684\u4f18\u5148\u7ea7\uff0c\u4e5f\u662f\u6784\u5efa\u5806\u65f6\u91c7\u53d6\u7684\u4f9d\u636e\u3002<\/p>\n\n\n\n

\n
 1         \/\/\/ <summary>\n 2         \/\/\/ \u5b9a\u4e49\u4e00\u4e2a\u6570\u7ec4\u6765\u5b58\u653e\u8282\u70b9\n 3         \/\/\/ <\/summary>\n 4         private List<HeapNode> nodeList = new List<HeapNode>();\n 5 \n 6         #region \u5806\u8282\u70b9\u5b9a\u4e49\n 7         \/\/\/ <summary>\n 8         \/\/\/ \u5806\u8282\u70b9\u5b9a\u4e49\n 9         \/\/\/ <\/summary>\n10         public class HeapNode\n11         {\n12             \/\/\/ <summary>\n13             \/\/\/ \u5b9e\u4f53\u6570\u636e\n14             \/\/\/ <\/summary>\n15             public T t { get; set; }\n16 \n17             \/\/\/ <summary>\n18             \/\/\/ \u4f18\u5148\u7ea7\u522b 1-10\u4e2a\u7ea7\u522b (\u4f18\u5148\u7ea7\u522b\u9012\u589e)\n19             \/\/\/ <\/summary>\n20             public int level { get; set; }\n21 \n22             public HeapNode(T t, int level)\n23             {\n24                 this.t = t;\n25                 this.level = level;\n26             }\n27 \n28             public HeapNode() { }\n29         }\n30         #endregion<\/pre>\n<\/div>\n\n\n\n
<2> \u5165\u961f\u64cd\u4f5c<\/p>\n\n\n\n
\u5165\u961f\u64cd\u4f5c\u65f6\u6211\u4eec\u8981\u6ce8\u610f\u51e0\u4e2a\u95ee\u9898\uff1a<\/p>\n\n\n\n
\u2460\uff1a\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u6784\u5efa\u64cd\u4f5c\u662f\u201c\u4ece\u4e0a\u5230\u4e0b\uff0c\u4ece\u5de6\u5230\u53f3\u201d\u7684\u5f62\u5f0f\uff0c\u6240\u4ee5\u5165\u961f\u7684\u8282\u70b9\u662f\u653e\u5728\u6570\u7ec4\u7684\u6700\u540e\uff0c\u4e5f\u5c31\u662f\u6811\u4e2d\u53f6\u5b50\u5c42\u7684\u6709\u5e8f\u6700\u53f3\u8fb9\u7a7a\u4f4d\u3002<\/p>\n\n\n\n
\u2461\uff1a\u5f53\u8282\u70b9\u63d2\u5165\u5230\u6700\u540e\u65f6\uff0c\u6709\u53ef\u80fd\u7834\u574f\u4e86\u5806\u7684\u6027\u8d28\uff0c\u6b64\u65f6\u6211\u4eec\u8981\u8fdb\u884c\u201c\u4e0a\u6ee4\u64cd\u4f5c\u201d\uff0c\u5f53\u7136\u65f6\u95f4\u590d\u6742\u5ea6\u4e3aO(lgN)\u3002<\/p>\n\n\n\n
\"\"<\/a><\/figure>\n\n\n\n
<\/p>\n\n\n\n
\u5f53\u6211\u5c06\u8282\u70b9\u201c20\u201d\u63d2\u5165\u5230\u5806\u5c3e\u7684\u65f6\u5019\uff0c\u6b64\u65f6\u7834\u574f\u4e86\u5806\u7684\u6027\u8d28\uff0c\u4ece\u56fe\u4e2d\u6211\u4eec\u53ef\u4ee5\u6e05\u695a\u7684\u770b\u5230\u8282\u70b9\u201c20\u201d\u7684\u6574\u4e2a\u4e0a\u6ee4\u8fc7\u7a0b\uff0c\u6709\u610f\u601d\u5427\uff0c\u8fd8\u6709\u4e00\u70b9<\/p>\n\n\n\n
\u5c31\u662f\uff1a\u83b7\u53d6\u63d2\u5165\u8282\u70b9\u7684\u7236\u4eb2\u8282\u70b9\u7684\u7b97\u6cd5\u662f\uff1aparent=list.count\/2-1\u3002\u8fd9\u4e5f\u5f97\u76ca\u4e8e\u5b8c\u5168\u4e8c\u53c9\u6811\u7684\u7279\u6027\u3002<\/p>\n\n\n\n
\n
 1         #region  \u6dfb\u52a0\u64cd\u4f5c\n 2         \/\/\/ <summary>\n 3         \/\/\/ \u6dfb\u52a0\u64cd\u4f5c\n 4         \/\/\/ <\/summary>\n 5         public void Eequeue(T t, int level = 1)\n 6         {\n 7             \/\/\u5c06\u5f53\u524d\u8282\u70b9\u8ffd\u52a0\u5230\u5806\u5c3e\n 8             nodeList.Add(new HeapNode(t, level));\n 9 \n10             \/\/\u5982\u679c\u53ea\u6709\u4e00\u4e2a\u8282\u70b9\uff0c\u5219\u4e0d\u9700\u8981\u8fdb\u884c\u7b5b\u64cd\u4f5c\n11             if (nodeList.Count == 1)\n12                 return;\n13 \n14             \/\/\u83b7\u53d6\u6700\u540e\u4e00\u4e2a\u975e\u53f6\u5b50\u8282\u70b9\n15             int parent = nodeList.Count \/ 2 - 1;\n16 \n17             \/\/\u5806\u8c03\u6574\n18             UpHeapAdjust(nodeList, parent);\n19         }\n20         #endregion\n21 \n22         #region \u5bf9\u5806\u8fdb\u884c\u4e0a\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n23         \/\/\/ <summary>\n24         \/\/\/ \u5bf9\u5806\u8fdb\u884c\u4e0a\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n25         \/\/\/ <\/summary>\n26         \/\/\/ <param name=\"nodeList\"><\/param>\n27         \/\/\/ <param name=\"index\">\u975e\u53f6\u5b50\u8282\u70b9\u7684\u4e4b\u540e\u6307\u9488\uff08\u8fd9\u91cc\u8981\u6ce8\u610f\uff1a\u6211\u4eec\n28         \/\/\/ \u7684\u7b5b\u64cd\u4f5c\u65f6\u9488\u5bf9\u975e\u53f6\u8282\u70b9\u7684\uff09\n29         \/\/\/ <\/param>\n30         public void UpHeapAdjust(List<HeapNode> nodeList, int parent)\n31         {\n32             while (parent >= 0)\n33             {\n34                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u5de6\u5b69\u5b50\n35                 var left = 2 * parent + 1;\n36 \n37                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u53f3\u5b69\u5b50\n38                 var right = left + 1;\n39 \n40                 \/\/parent\u5b50\u8282\u70b9\u4e2d\u6700\u5927\u7684\u5b69\u5b50\u8282\u70b9\uff0c\u65b9\u4fbf\u4e8eparent\u8fdb\u884c\u6bd4\u8f83\n41                 \/\/\u9ed8\u8ba4\u4e3aleft\u8282\u70b9\n42                 var max = left;\n43 \n44                 \/\/\u5224\u65ad\u5f53\u524d\u8282\u70b9\u662f\u5426\u6709\u53f3\u5b69\u5b50\n45                 if (right < nodeList.Count)\n46                 {\n47                     \/\/\u5224\u65adparent\u8981\u6bd4\u8f83\u7684\u6700\u5927\u5b50\u8282\u70b9\n48                     max = nodeList[left].level < nodeList[right].level ? right : left;\n49                 }\n50 \n51                 \/\/\u5982\u679cparent\u8282\u70b9\u5c0f\u4e8e\u5b83\u7684\u67d0\u4e2a\u5b50\u8282\u70b9\u7684\u8bdd\uff0c\u6b64\u65f6\u7b5b\u64cd\u4f5c\n52                 if (nodeList[parent].level < nodeList[max].level)\n53                 {\n54                     \/\/\u5b50\u8282\u70b9\u548c\u7236\u8282\u70b9\u8fdb\u884c\u4ea4\u6362\u64cd\u4f5c\n55                     var temp = nodeList[parent];\n56                     nodeList[parent] = nodeList[max];\n57                     nodeList[max] = temp;\n58 \n59                     \/\/\u7ee7\u7eed\u8fdb\u884c\u66f4\u4e0a\u4e00\u5c42\u7684\u8fc7\u6ee4\n60                     parent = (int)Math.Ceiling(parent \/ 2d) - 1;\n61                 }\n62                 else\n63                 {\n64                     break;\n65                 }\n66             }\n67         }\n68         #endregion<\/pre>\n<\/div>\n\n\n\n
<3> \u51fa\u961f\u64cd\u4f5c<\/p>\n\n\n\n
\u4ece\u56fe\u4e2d\u6211\u4eec\u53ef\u4ee5\u770b\u51fa\uff0c\u4f18\u5148\u7ea7\u6700\u5927\u7684\u8282\u70b9\u4f1a\u5728\u4e00\u9635\u75c9\u631b\u540e\u4e0a\u5347\u5230\u5806\u9876\uff0c\u51fa\u961f\u64cd\u4f5c\u65f6\uff0c\u6211\u4eec\u91c7\u53d6\u7684\u65b9\u6848\u662f\uff1a\u5f39\u51fa\u5806\u9876\u5143\u7d20\uff0c\u7136\u540e\u5c06\u53f6\u5b50\u5c42\u4e2d<\/p>\n\n\n\n
\u7684\u6700\u53f3\u5b50\u8282\u70b9\u8d4b\u7ed9\u5806\u9876\uff0c\u540c\u6837\u8fd9\u65f6\u4e5f\u4f1a\u53ef\u80fd\u5b58\u5728\u7834\u574f\u5806\u7684\u6027\u8d28\uff0c\u6700\u540e\u6211\u4eec\u8981\u88ab\u8feb\u8fdb\u884c\u4e0b\u6ee4\u64cd\u4f5c\u3002<\/p>\n\n\n\n
\"\"<\/a><\/figure>\n\n\n\n
<\/p>\n\n\n\n
\u6211\u56fe\u4e2d\u53ef\u4ee5\u770b\u51fa\uff1a\u9996\u5148\u5c06\u5806\u987620\u5f39\u51fa\uff0c\u7136\u540e\u5c067\u8d4b\u7ed9\u5806\u9876\uff0c\u6b64\u65f6\u5806\u6027\u8d28\u906d\u5230\u7834\u574f\uff0c\u6700\u540e\u6211\u4eec\u6e05\u695a\u7684\u770b\u5230\u8282\u70b97\u7684\u4e0b\u6ee4\u8fc7\u7a0b\uff0c\u4ece\u644a\u8fd8\u5206\u6790\u7684\u89d2\u5ea6\u4e0a<\/p>\n\n\n\n
\u6765\u8bf4\uff0c\u4e0b\u6ee4\u7684\u5c42\u6570\u4e0d\u8d85\u8fc72-3\u5c42\uff0c\u6240\u4ee5\u6574\u4f53\u4e0a\u6765\u8bf4\u51fa\u961f\u7684\u65f6\u95f4\u590d\u6742\u5ea6\u4e3a\u4e00\u4e2a\u5e38\u91cfO(1)\u3002<\/p>\n\n\n\n
\n
 1         #region \u4f18\u5148\u961f\u5217\u7684\u51fa\u961f\u64cd\u4f5c\n 2         \/\/\/ <summary>\n 3         \/\/\/ \u4f18\u5148\u961f\u5217\u7684\u51fa\u961f\u64cd\u4f5c\n 4         \/\/\/ <\/summary>\n 5         \/\/\/ <returns><\/returns>\n 6         public HeapNode Dequeue()\n 7         {\n 8             if (nodeList.Count == 0)\n 9                 return null;\n10 \n11             \/\/\u51fa\u961f\u5217\u64cd\u4f5c\uff0c\u5f39\u51fa\u6570\u636e\u5934\u5143\u7d20\n12             var pop = nodeList[0];\n13 \n14             \/\/\u7528\u5c3e\u5143\u7d20\u586b\u5145\u5934\u5143\u7d20\n15             nodeList[0] = nodeList[nodeList.Count - 1];\n16 \n17             \/\/\u5220\u9664\u5c3e\u8282\u70b9\n18             nodeList.RemoveAt(nodeList.Count - 1);\n19 \n20             \/\/\u7136\u540e\u4ece\u6839\u8282\u70b9\u4e0b\u6ee4\u5806\n21             DownHeapAdjust(nodeList, 0);\n22 \n23             return pop;\n24         }\n25         #endregion\n26 \n27         #region  \u5bf9\u5806\u8fdb\u884c\u4e0b\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n28         \/\/\/ <summary>\n29         \/\/\/ \u5bf9\u5806\u8fdb\u884c\u4e0b\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28\n30         \/\/\/ <\/summary>\n31         \/\/\/ <param name=\"nodeList\"><\/param>\n32         \/\/\/ <param name=\"index\">\u975e\u53f6\u5b50\u8282\u70b9\u7684\u4e4b\u540e\u6307\u9488\uff08\u8fd9\u91cc\u8981\u6ce8\u610f\uff1a\u6211\u4eec\n33         \/\/\/ \u7684\u7b5b\u64cd\u4f5c\u65f6\u9488\u5bf9\u975e\u53f6\u8282\u70b9\u7684\uff09\n34         \/\/\/ <\/param>\n35         public void DownHeapAdjust(List<HeapNode> nodeList, int parent)\n36         {\n37             while (2 * parent + 1 < nodeList.Count)\n38             {\n39                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u5de6\u5b69\u5b50\n40                 var left = 2 * parent + 1;\n41 \n42                 \/\/\u5f53\u524dindex\u8282\u70b9\u7684\u53f3\u5b69\u5b50\n43                 var right = left + 1;\n44 \n45                 \/\/parent\u5b50\u8282\u70b9\u4e2d\u6700\u5927\u7684\u5b69\u5b50\u8282\u70b9\uff0c\u65b9\u4fbf\u4e8eparent\u8fdb\u884c\u6bd4\u8f83\n46                 \/\/\u9ed8\u8ba4\u4e3aleft\u8282\u70b9\n47                 var max = left;\n48 \n49                 \/\/\u5224\u65ad\u5f53\u524d\u8282\u70b9\u662f\u5426\u6709\u53f3\u5b69\u5b50\n50                 if (right < nodeList.Count)\n51                 {\n52                     \/\/\u5224\u65adparent\u8981\u6bd4\u8f83\u7684\u6700\u5927\u5b50\u8282\u70b9\n53                     max = nodeList[left].level < nodeList[right].level ? right : left;\n54                 }\n55 \n56                 \/\/\u5982\u679cparent\u8282\u70b9\u5c0f\u4e8e\u5b83\u7684\u67d0\u4e2a\u5b50\u8282\u70b9\u7684\u8bdd\uff0c\u6b64\u65f6\u7b5b\u64cd\u4f5c\n57                 if (nodeList[parent].level < nodeList[max].level)\n58                 {\n59                     \/\/\u5b50\u8282\u70b9\u548c\u7236\u8282\u70b9\u8fdb\u884c\u4ea4\u6362\u64cd\u4f5c\n60                     var temp = nodeList[parent];\n61                     nodeList[parent] = nodeList[max];\n62                     nodeList[max] = temp;\n63 \n64                     \/\/\u7ee7\u7eed\u8fdb\u884c\u66f4\u4e0b\u4e00\u5c42\u7684\u8fc7\u6ee4\n65                     parent = max;\n66                 }\n67                 else\n68                 {\n69                     break;\n70                 }\n71             }\n72         }\n73         #endregion<\/pre>\n<\/div>\n\n\n\n
\u6700\u540e\u6211\u8fd8\u6269\u5c55\u4e86\u4e00\u4e2a\u5f39\u51fa\u5e76\u4e0b\u964d\u8282\u70b9\u4f18\u5148\u7ea7\u7684\u65b9\u6cd5\uff0c\u597d\u5427\uff0c\u8fd9\u4e2a\u65b9\u6cd5\u5927\u5bb6\u81ea\u5df1\u7422\u78e8\u7422\u78e8\uff0c\u5f88\u6709\u610f\u601d\u7684\uff0c\u5b9e\u9645\u5e94\u7528\u4e2d\u4f7f\u7528\u5230\u4e86\u3002<\/p>\n\n\n\n
\n
\n
\n\n\n\n
\n
1<\/div>\n
2<\/div>\n
3<\/div>\n
4<\/div>\n
5<\/div>\n
6<\/div>\n
7<\/div>\n
8<\/div>\n
9<\/div>\n
10<\/div>\n
11<\/div>\n
12<\/div>\n
13<\/div>\n
14<\/div>\n
15<\/div>\n
16<\/div>\n
17<\/div>\n
18<\/div>\n
19<\/div>\n
20<\/div>\n
21<\/div>\n
22<\/div>\n
23<\/div>\n
24<\/div>\n
25<\/div>\n
26<\/div>\n
27<\/div>\n
28<\/div>\n
29<\/div>\n
30<\/div>\n
31<\/div>\n
32<\/div>\n
33<\/div>\n
34<\/div>\n
35<\/div>\n
36<\/div>\n
37<\/div>\n
38<\/div>\n
39<\/div>\n
40<\/div>\n
41<\/div>\n
42<\/div>\n
43<\/div>\n
44<\/div>\n
45<\/div>\n
46<\/div>\n
47<\/div>\n
48<\/div>\n
49<\/div>\n
50<\/div>\n
51<\/div>\n
52<\/div>\n
53<\/div>\n
54<\/div>\n
55<\/div>\n
56<\/div>\n
57<\/div>\n
58<\/div>\n
59<\/div>\n
60<\/div>\n
61<\/div>\n
62<\/div>\n
63<\/div>\n
64<\/div>\n
65<\/div>\n
66<\/div>\n
67<\/div>\n
68<\/div>\n
69<\/div>\n
70<\/div>\n
71<\/div>\n
72<\/div>\n
73<\/div>\n
74<\/div>\n
75<\/div>\n
76<\/div>\n
77<\/div>\n
78<\/div>\n
79<\/div>\n
80<\/div>\n
81<\/div>\n
82<\/div>\n
83<\/div>\n
84<\/div>\n
85<\/div>\n
86<\/div>\n
87<\/div>\n
88<\/div>\n
89<\/div>\n
90<\/div>\n
91<\/div>\n
92<\/div>\n
93<\/div>\n
94<\/div>\n
95<\/div>\n
96<\/div>\n
97<\/div>\n
98<\/div>\n
99<\/div>\n
100<\/div>\n
101<\/div>\n
102<\/div>\n
103<\/div>\n
104<\/div>\n
105<\/div>\n
106<\/div>\n
107<\/div>\n
108<\/div>\n
109<\/div>\n
110<\/div>\n
111<\/div>\n
112<\/div>\n
113<\/div>\n
114<\/div>\n
115<\/div>\n
116<\/div>\n
117<\/div>\n
118<\/div>\n
119<\/div>\n
120<\/div>\n
121<\/div>\n
122<\/div>\n
123<\/div>\n
124<\/div>\n
125<\/div>\n
126<\/div>\n
127<\/div>\n
128<\/div>\n
129<\/div>\n
130<\/div>\n
131<\/div>\n
132<\/div>\n
133<\/div>\n
134<\/div>\n
135<\/div>\n
136<\/div>\n
137<\/div>\n
138<\/div>\n
139<\/div>\n
140<\/div>\n
141<\/div>\n
142<\/div>\n
143<\/div>\n
144<\/div>\n
145<\/div>\n
146<\/div>\n
147<\/div>\n
148<\/div>\n
149<\/div>\n
150<\/div>\n
151<\/div>\n
152<\/div>\n
153<\/div>\n
154<\/div>\n
155<\/div>\n
156<\/div>\n
157<\/div>\n
158<\/div>\n
159<\/div>\n
160<\/div>\n
161<\/div>\n
162<\/div>\n
163<\/div>\n
164<\/div>\n
165<\/div>\n
166<\/div>\n
167<\/div>\n
168<\/div>\n
169<\/div>\n
170<\/div>\n
171<\/div>\n
172<\/div>\n
173<\/div>\n
174<\/div>\n
175<\/div>\n
176<\/div>\n
177<\/div>\n
178<\/div>\n
179<\/div>\n
180<\/div>\n
181<\/div>\n
182<\/div>\n
183<\/div>\n
184<\/div>\n
185<\/div>\n
186<\/div>\n
187<\/div>\n
188<\/div>\n
189<\/div>\n
190<\/div>\n
191<\/div>\n
192<\/div>\n
193<\/div>\n
194<\/div>\n
195<\/div>\n
196<\/div>\n
197<\/div>\n
198<\/div>\n
199<\/div>\n
200<\/div>\n
201<\/div>\n
202<\/div>\n
203<\/div>\n
204<\/div>\n
205<\/div>\n
206<\/div>\n
207<\/div>\n
208<\/div>\n
209<\/div>\n
210<\/div>\n
211<\/div>\n
212<\/div>\n
213<\/div>\n
214<\/div>\n
215<\/div>\n
216<\/div>\n
217<\/div>\n
218<\/div>\n
219<\/div>\n
220<\/div>\n
221<\/div>\n
222<\/div>\n
223<\/div>\n
224<\/div>\n
225<\/div>\n
226<\/div>\n
227<\/div>\n
228<\/div>\n
229<\/div>\n
230<\/div>\n
231<\/div>\n
232<\/div>\n
233<\/div>\n
234<\/div>\n
235<\/div>\n
236<\/div>\n
237<\/div>\n
238<\/div>\n
239<\/div>\n
240<\/div>\n
241<\/div>\n
242<\/div>\n
243<\/div>\n
244<\/div>\n
245<\/div>\n
246<\/div>\n
247<\/div>\n
248<\/div>\n
249<\/div>\n
250<\/div>\n
251<\/div>\n
252<\/div>\n
253<\/div>\n
254<\/div>\n
255<\/div>\n
256<\/div>\n
257<\/div>\n
258<\/div>\n
259<\/div>\n
260<\/div>\n
261<\/div>\n
262<\/div>\n<\/td>\n
\n
\n
using<\/code> System;<\/code><\/div>\n
using<\/code> System.Collections.Generic;<\/code><\/div>\n
using<\/code> System.Linq;<\/code><\/div>\n
using<\/code> System.Text;<\/code><\/div>\n
using<\/code> System.Diagnostics;<\/code><\/div>\n
using<\/code> System.Threading;<\/code><\/div>\n
using<\/code> System.IO;<\/code><\/div>\n
 <\/div>\n
namespace<\/code> ConsoleApplication2<\/code><\/div>\n
{<\/code><\/div>\n
    <\/code>public<\/code> class<\/code> Program<\/code><\/div>\n
    <\/code>{<\/code><\/div>\n
        <\/code>public<\/code> static<\/code> void<\/code> Main()<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>PriorityQueue<Url> heap = <\/code>new<\/code> PriorityQueue<Url>();<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u968f\u673a\u63d2\u516520\u4e2a\u8282\u70b9<\/code><\/div>\n
            <\/code>for<\/code> (<\/code>int<\/code> i = 1; i < 20; i++)<\/code><\/div>\n
            <\/code>{<\/code><\/div>\n
                <\/code>var<\/code> rand = <\/code>new<\/code> Random().Next(1, 20);<\/code><\/div>\n
 <\/div>\n
                <\/code>Thread.Sleep(10);<\/code><\/div>\n
 <\/div>\n
                <\/code>heap.Eequeue(<\/code>new<\/code> Url() { Data = <\/code>\"test\"<\/code> + i }, i);<\/code><\/div>\n
            <\/code>}<\/code><\/div>\n
 <\/div>\n
            <\/code>while<\/code> (<\/code>true<\/code>)<\/code><\/div>\n
            <\/code>{<\/code><\/div>\n
                <\/code>var<\/code> node = heap.Dequeue();<\/code><\/div>\n
 <\/div>\n
                <\/code>if<\/code> (node == <\/code>null<\/code>)<\/code><\/div>\n
                    <\/code>break<\/code>;<\/code><\/div>\n
 <\/div>\n
                <\/code>Console.WriteLine(<\/code>\"\u5f53\u524durl\u7684\u4f18\u5148\u7ea7\u4e3a:{0},\u6570\u636e\u4e3a:{1}\"<\/code>, node.level, node.t.Data);<\/code><\/div>\n
            <\/code>}<\/code><\/div>\n
 <\/div>\n
            <\/code>Console.Read();<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
    <\/code>}<\/code><\/div>\n
 <\/div>\n
    <\/code>#region \u5b9a\u4e49\u4e00\u4e2a\u5b9e\u4f53<\/code><\/div>\n
    <\/code>\/\/\/ <summary><\/code><\/div>\n
    <\/code>\/\/\/ \u5b9a\u4e49\u4e00\u4e2a\u5b9e\u4f53<\/code><\/div>\n
    <\/code>\/\/\/ <\/summary><\/code><\/div>\n
    <\/code>public<\/code> class<\/code> Url<\/code><\/div>\n
    <\/code>{<\/code><\/div>\n
        <\/code>public<\/code> string<\/code> Data { <\/code>get<\/code>; <\/code>set<\/code>; }<\/code><\/div>\n
    <\/code>}<\/code><\/div>\n
    <\/code>#endregion<\/code><\/div>\n
 <\/div>\n
    <\/code>public<\/code> class<\/code> PriorityQueue<T> <\/code>where<\/code> T : <\/code>class<\/code><\/div>\n
    <\/code>{<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u5b9a\u4e49\u4e00\u4e2a\u6570\u7ec4\u6765\u5b58\u653e\u8282\u70b9<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>private<\/code> List<HeapNode> nodeList = <\/code>new<\/code> List<HeapNode>();<\/code><\/div>\n
 <\/div>\n
        <\/code>#region \u5806\u8282\u70b9\u5b9a\u4e49<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u5806\u8282\u70b9\u5b9a\u4e49<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>public<\/code> class<\/code> HeapNode<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>\/\/\/ <summary><\/code><\/div>\n
            <\/code>\/\/\/ \u5b9e\u4f53\u6570\u636e<\/code><\/div>\n
            <\/code>\/\/\/ <\/summary><\/code><\/div>\n
            <\/code>public<\/code> T t { <\/code>get<\/code>; <\/code>set<\/code>; }<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\/ <summary><\/code><\/div>\n
            <\/code>\/\/\/ \u4f18\u5148\u7ea7\u522b 1-10\u4e2a\u7ea7\u522b (\u4f18\u5148\u7ea7\u522b\u9012\u589e)<\/code><\/div>\n
            <\/code>\/\/\/ <\/summary><\/code><\/div>\n
            <\/code>public<\/code> int<\/code> level { <\/code>get<\/code>; <\/code>set<\/code>; }<\/code><\/div>\n
 <\/div>\n
            <\/code>public<\/code> HeapNode(T t, <\/code>int<\/code> level)<\/code><\/div>\n
            <\/code>{<\/code><\/div>\n
                <\/code>this<\/code>.t = t;<\/code><\/div>\n
                <\/code>this<\/code>.level = level;<\/code><\/div>\n
            <\/code>}<\/code><\/div>\n
 <\/div>\n
            <\/code>public<\/code> HeapNode() { }<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
        <\/code>#endregion<\/code><\/div>\n
 <\/div>\n
        <\/code>#region  \u6dfb\u52a0\u64cd\u4f5c<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u6dfb\u52a0\u64cd\u4f5c<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>public<\/code> void<\/code> Eequeue(T t, <\/code>int<\/code> level = 1)<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>\/\/\u5c06\u5f53\u524d\u8282\u70b9\u8ffd\u52a0\u5230\u5806\u5c3e<\/code><\/div>\n
            <\/code>nodeList.Add(<\/code>new<\/code> HeapNode(t, level));<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u5982\u679c\u53ea\u6709\u4e00\u4e2a\u8282\u70b9\uff0c\u5219\u4e0d\u9700\u8981\u8fdb\u884c\u7b5b\u64cd\u4f5c<\/code><\/div>\n
            <\/code>if<\/code> (nodeList.Count == 1)<\/code><\/div>\n
                <\/code>return<\/code>;<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u83b7\u53d6\u6700\u540e\u4e00\u4e2a\u975e\u53f6\u5b50\u8282\u70b9<\/code><\/div>\n
            <\/code>int<\/code> parent = nodeList.Count \/ 2 - 1;<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u5806\u8c03\u6574<\/code><\/div>\n
            <\/code>UpHeapAdjust(nodeList, parent);<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
        <\/code>#endregion<\/code><\/div>\n
 <\/div>\n
        <\/code>#region \u5bf9\u5806\u8fdb\u884c\u4e0a\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u5bf9\u5806\u8fdb\u884c\u4e0a\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>\/\/\/ <param name=\"nodeList\"><\/param><\/code><\/div>\n
        <\/code>\/\/\/ <param name=\"index\">\u975e\u53f6\u5b50\u8282\u70b9\u7684\u4e4b\u540e\u6307\u9488\uff08\u8fd9\u91cc\u8981\u6ce8\u610f\uff1a\u6211\u4eec<\/code><\/div>\n
        <\/code>\/\/\/ \u7684\u7b5b\u64cd\u4f5c\u65f6\u9488\u5bf9\u975e\u53f6\u8282\u70b9\u7684\uff09<\/code><\/div>\n
        <\/code>\/\/\/ <\/param><\/code><\/div>\n
        <\/code>public<\/code> void<\/code> UpHeapAdjust(List<HeapNode> nodeList, <\/code>int<\/code> parent)<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>while<\/code> (parent >= 0)<\/code><\/div>\n
            <\/code>{<\/code><\/div>\n
                <\/code>\/\/\u5f53\u524dindex\u8282\u70b9\u7684\u5de6\u5b69\u5b50<\/code><\/div>\n
                <\/code>var<\/code> left = 2 * parent + 1;<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/\u5f53\u524dindex\u8282\u70b9\u7684\u53f3\u5b69\u5b50<\/code><\/div>\n
                <\/code>var<\/code> right = left + 1;<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/parent\u5b50\u8282\u70b9\u4e2d\u6700\u5927\u7684\u5b69\u5b50\u8282\u70b9\uff0c\u65b9\u4fbf\u4e8eparent\u8fdb\u884c\u6bd4\u8f83<\/code><\/div>\n
                <\/code>\/\/\u9ed8\u8ba4\u4e3aleft\u8282\u70b9<\/code><\/div>\n
                <\/code>var<\/code> max = left;<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/\u5224\u65ad\u5f53\u524d\u8282\u70b9\u662f\u5426\u6709\u53f3\u5b69\u5b50<\/code><\/div>\n
                <\/code>if<\/code> (right < nodeList.Count)<\/code><\/div>\n
                <\/code>{<\/code><\/div>\n
                    <\/code>\/\/\u5224\u65adparent\u8981\u6bd4\u8f83\u7684\u6700\u5927\u5b50\u8282\u70b9<\/code><\/div>\n
                    <\/code>max = nodeList[left].level < nodeList[right].level ? right : left;<\/code><\/div>\n
                <\/code>}<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/\u5982\u679cparent\u8282\u70b9\u5c0f\u4e8e\u5b83\u7684\u67d0\u4e2a\u5b50\u8282\u70b9\u7684\u8bdd\uff0c\u6b64\u65f6\u7b5b\u64cd\u4f5c<\/code><\/div>\n
                <\/code>if<\/code> (nodeList[parent].level < nodeList[max].level)<\/code><\/div>\n
                <\/code>{<\/code><\/div>\n
                    <\/code>\/\/\u5b50\u8282\u70b9\u548c\u7236\u8282\u70b9\u8fdb\u884c\u4ea4\u6362\u64cd\u4f5c<\/code><\/div>\n
                    <\/code>var<\/code> temp = nodeList[parent];<\/code><\/div>\n
                    <\/code>nodeList[parent] = nodeList[max];<\/code><\/div>\n
                    <\/code>nodeList[max] = temp;<\/code><\/div>\n
 <\/div>\n
                    <\/code>\/\/\u7ee7\u7eed\u8fdb\u884c\u66f4\u4e0a\u4e00\u5c42\u7684\u8fc7\u6ee4<\/code><\/div>\n
                    <\/code>parent = (<\/code>int<\/code>)Math.Ceiling(parent \/ 2d) - 1;<\/code><\/div>\n
                <\/code>}<\/code><\/div>\n
                <\/code>else<\/code><\/div>\n
                <\/code>{<\/code><\/div>\n
                    <\/code>break<\/code>;<\/code><\/div>\n
                <\/code>}<\/code><\/div>\n
            <\/code>}<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
        <\/code>#endregion<\/code><\/div>\n
 <\/div>\n
        <\/code>#region \u4f18\u5148\u961f\u5217\u7684\u51fa\u961f\u64cd\u4f5c<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u4f18\u5148\u961f\u5217\u7684\u51fa\u961f\u64cd\u4f5c<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>\/\/\/ <returns><\/returns><\/code><\/div>\n
        <\/code>public<\/code> HeapNode Dequeue()<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>if<\/code> (nodeList.Count == 0)<\/code><\/div>\n
                <\/code>return<\/code> null<\/code>;<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u51fa\u961f\u5217\u64cd\u4f5c\uff0c\u5f39\u51fa\u6570\u636e\u5934\u5143\u7d20<\/code><\/div>\n
            <\/code>var<\/code> pop = nodeList[0];<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u7528\u5c3e\u5143\u7d20\u586b\u5145\u5934\u5143\u7d20<\/code><\/div>\n
            <\/code>nodeList[0] = nodeList[nodeList.Count - 1];<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u5220\u9664\u5c3e\u8282\u70b9<\/code><\/div>\n
            <\/code>nodeList.RemoveAt(nodeList.Count - 1);<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u7136\u540e\u4ece\u6839\u8282\u70b9\u4e0b\u6ee4\u5806<\/code><\/div>\n
            <\/code>DownHeapAdjust(nodeList, 0);<\/code><\/div>\n
 <\/div>\n
            <\/code>return<\/code> pop;<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
        <\/code>#endregion<\/code><\/div>\n
 <\/div>\n
        <\/code>#region  \u5bf9\u5806\u8fdb\u884c\u4e0b\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u5bf9\u5806\u8fdb\u884c\u4e0b\u6ee4\u64cd\u4f5c\uff0c\u4f7f\u5f97\u6ee1\u8db3\u5806\u6027\u8d28<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>\/\/\/ <param name=\"nodeList\"><\/param><\/code><\/div>\n
        <\/code>\/\/\/ <param name=\"index\">\u975e\u53f6\u5b50\u8282\u70b9\u7684\u4e4b\u540e\u6307\u9488\uff08\u8fd9\u91cc\u8981\u6ce8\u610f\uff1a\u6211\u4eec<\/code><\/div>\n
        <\/code>\/\/\/ \u7684\u7b5b\u64cd\u4f5c\u65f6\u9488\u5bf9\u975e\u53f6\u8282\u70b9\u7684\uff09<\/code><\/div>\n
        <\/code>\/\/\/ <\/param><\/code><\/div>\n
        <\/code>public<\/code> void<\/code> DownHeapAdjust(List<HeapNode> nodeList, <\/code>int<\/code> parent)<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>while<\/code> (2 * parent + 1 < nodeList.Count)<\/code><\/div>\n
            <\/code>{<\/code><\/div>\n
                <\/code>\/\/\u5f53\u524dindex\u8282\u70b9\u7684\u5de6\u5b69\u5b50<\/code><\/div>\n
                <\/code>var<\/code> left = 2 * parent + 1;<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/\u5f53\u524dindex\u8282\u70b9\u7684\u53f3\u5b69\u5b50<\/code><\/div>\n
                <\/code>var<\/code> right = left + 1;<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/parent\u5b50\u8282\u70b9\u4e2d\u6700\u5927\u7684\u5b69\u5b50\u8282\u70b9\uff0c\u65b9\u4fbf\u4e8eparent\u8fdb\u884c\u6bd4\u8f83<\/code><\/div>\n
                <\/code>\/\/\u9ed8\u8ba4\u4e3aleft\u8282\u70b9<\/code><\/div>\n
                <\/code>var<\/code> max = left;<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/\u5224\u65ad\u5f53\u524d\u8282\u70b9\u662f\u5426\u6709\u53f3\u5b69\u5b50<\/code><\/div>\n
                <\/code>if<\/code> (right < nodeList.Count)<\/code><\/div>\n
                <\/code>{<\/code><\/div>\n
                    <\/code>\/\/\u5224\u65adparent\u8981\u6bd4\u8f83\u7684\u6700\u5927\u5b50\u8282\u70b9<\/code><\/div>\n
                    <\/code>max = nodeList[left].level < nodeList[right].level ? right : left;<\/code><\/div>\n
                <\/code>}<\/code><\/div>\n
 <\/div>\n
                <\/code>\/\/\u5982\u679cparent\u8282\u70b9\u5c0f\u4e8e\u5b83\u7684\u67d0\u4e2a\u5b50\u8282\u70b9\u7684\u8bdd\uff0c\u6b64\u65f6\u7b5b\u64cd\u4f5c<\/code><\/div>\n
                <\/code>if<\/code> (nodeList[parent].level < nodeList[max].level)<\/code><\/div>\n
                <\/code>{<\/code><\/div>\n
                    <\/code>\/\/\u5b50\u8282\u70b9\u548c\u7236\u8282\u70b9\u8fdb\u884c\u4ea4\u6362\u64cd\u4f5c<\/code><\/div>\n
                    <\/code>var<\/code> temp = nodeList[parent];<\/code><\/div>\n
                    <\/code>nodeList[parent] = nodeList[max];<\/code><\/div>\n
                    <\/code>nodeList[max] = temp;<\/code><\/div>\n
 <\/div>\n
                    <\/code>\/\/\u7ee7\u7eed\u8fdb\u884c\u66f4\u4e0b\u4e00\u5c42\u7684\u8fc7\u6ee4<\/code><\/div>\n
                    <\/code>parent = max;<\/code><\/div>\n
                <\/code>}<\/code><\/div>\n
                <\/code>else<\/code><\/div>\n
                <\/code>{<\/code><\/div>\n
                    <\/code>break<\/code>;<\/code><\/div>\n
                <\/code>}<\/code><\/div>\n
            <\/code>}<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
        <\/code>#endregion<\/code><\/div>\n
 <\/div>\n
        <\/code>#region \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u5230\u6307\u5b9a\u7684level\u7ea7\u522b<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u5230\u6307\u5b9a\u7684level\u7ea7\u522b<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>\/\/\/ <returns><\/returns><\/code><\/div>\n
        <\/code>public<\/code> HeapNode GetAndDownPriority(<\/code>int<\/code> level)<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>if<\/code> (nodeList.Count == 0)<\/code><\/div>\n
                <\/code>return<\/code> null<\/code>;<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u83b7\u53d6\u5934\u5143\u7d20<\/code><\/div>\n
            <\/code>var<\/code> pop = nodeList[0];<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u8bbe\u7f6e\u6307\u5b9a\u4f18\u5148\u7ea7\uff08\u5982\u679c\u4e3a MinValue \u5219\u4e3a -- \u64cd\u4f5c\uff09<\/code><\/div>\n
            <\/code>nodeList[0].level = level == <\/code>int<\/code>.MinValue ? --nodeList[0].level : level;<\/code><\/div>\n
 <\/div>\n
            <\/code>\/\/\u4e0b\u6ee4\u5806<\/code><\/div>\n
            <\/code>DownHeapAdjust(nodeList, 0);<\/code><\/div>\n
 <\/div>\n
            <\/code>return<\/code> nodeList[0];<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
        <\/code>#endregion<\/code><\/div>\n
 <\/div>\n
        <\/code>#region \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u4f18\u5148\u7ea7<\/code><\/div>\n
        <\/code>\/\/\/ <summary><\/code><\/div>\n
        <\/code>\/\/\/ \u83b7\u53d6\u5143\u7d20\u5e76\u4e0b\u964d\u4f18\u5148\u7ea7<\/code><\/div>\n
        <\/code>\/\/\/ <\/summary><\/code><\/div>\n
        <\/code>\/\/\/ <returns><\/returns><\/code><\/div>\n
        <\/code>public<\/code> HeapNode GetAndDownPriority()<\/code><\/div>\n
        <\/code>{<\/code><\/div>\n
            <\/code>\/\/\u4e0b\u964d\u4e00\u4e2a\u4f18\u5148\u7ea7<\/code><\/div>\n
            <\/code>return<\/code> GetAndDownPriority(<\/code>int<\/code>.MinValue);<\/code><\/div>\n
        <\/code>}<\/code><\/div>\n
        <\/code>#endregion<\/code><\/div>\n
    <\/code>}<\/code><\/div>\n
}<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n
\"\"<\/a><\/figure>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
\u4f18\u5148\u961f\u5217\uff0c\u975e\u5806\u83ab\u5c5e\u3002 \u4e00\uff1a\u5806\u7ed3\u6784 1:\u6027\u8d28 \u5806\u662f\u4e00\u79cd\u5f88\u677e\u6563\u7684\u5e8f\u7ed3\u6784\u6811\uff0c\u53ea\u4fdd\u5b58\u4e86\u7236\u8282\u70b9\u548c\u5b69\u5b50\u8282\u70b9\u7684\u5927\u5c0f\u5173\u7cfb\uff0c\u5e76\u4e0d … \u9605\u8bfb\u66f4\u591a<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[5],"tags":[551,552],"class_list":["post-1793","post","type-post","status-publish","format-standard","hentry","category-jishu","tag-551","tag-552"],"aioseo_notices":[],"jetpack_featured_media_url":"","jetpack-related-posts":[],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1793","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/comments?post=1793"}],"version-history":[{"count":3,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1793\/revisions"}],"predecessor-version":[{"id":9074,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/posts\/1793\/revisions\/9074"}],"wp:attachment":[{"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/media?parent=1793"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/categories?post=1793"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cn.hostease.com\/xueyuan\/wp-json\/wp\/v2\/tags?post=1793"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}