{"id":3737,"date":"2019-08-04T13:44:02","date_gmt":"2019-08-04T05:44:02","guid":{"rendered":"https:\/\/damogame.cn\/wordpress\/?p=3737"},"modified":"2019-08-04T13:44:02","modified_gmt":"2019-08-04T05:44:02","slug":"%e6%9c%80%e5%b0%8f%e5%a0%86%e3%80%82%e6%9c%80%e5%a4%a7%e5%a0%86","status":"publish","type":"post","link":"https:\/\/i007.cc\/wordpress\/archives\/3737","title":{"rendered":"\u6700\u5c0f\u5806\u3002\u6700\u5927\u5806"},"content":{"rendered":"
\n
\n
<\/div>\n
\n
\u539f\u6587\u5730\u5740<\/a><\/div>\n
<\/div>\n<\/div>\n<\/div>\n<\/div>\n
\n
\n
\n

\u6700\u5927\u5806\u548c\u6700\u5c0f\u5806\u662f\u4e8c\u53c9\u5806\u7684\u4e24\u79cd\u5f62\u5f0f\u3002<\/p>\n

\u6700\u5927\u5806\uff1a\u6839\u7ed3\u70b9\u7684\u952e\u503c\u662f\u6240\u6709\u5806\u7ed3\u70b9\u952e\u503c\u4e2d\u6700\u5927\u8005\uff0c\u4e14\u6bcf\u4e2a\u7ed3\u70b9\u7684\u503c\u90fd\u6bd4\u5176\u5b69\u5b50\u7684\u503c\u5927\u3002<\/p>\n

\u6700\u5c0f\u5806\uff1a\u6839\u7ed3\u70b9\u7684\u952e\u503c\u662f\u6240\u6709\u5806\u7ed3\u70b9\u952e\u503c\u4e2d\u6700\u5c0f\u8005\uff0c\u4e14\u6bcf\u4e2a\u7ed3\u70b9\u7684\u503c\u90fd\u6bd4\u5176\u5b69\u5b50\u7684\u503c\u5c0f\u3002<\/p>\n

\"\"<\/p>\n

\u6700\u5c0f\u5806\u548c\u6700\u5927\u5806\u7684\u589e\u5220\u6539\u76f8\u4f3c\uff0c\u5176\u5b9e\u5c31\u662f\u628a\u7b97\u6cd5\u4e2d\u7684\u5927\u4e8e\u6539\u4e3a\u5c0f\u4e8e\uff0c\u628a\u5c0f\u4e8e\u6539\u4e3a\u5927\u4e8e\u3002<\/p>\n

\u751f\u6210\u6700\u5927\u5806\uff1a\u6700\u5927\u5806\u901a\u5e38\u90fd\u662f\u4e00\u68f5\u5b8c\u5168\u4e8c\u53c9\u6811\uff0c\u56e0\u6b64\u6211\u4eec\u4f7f\u7528\u6570\u7ec4\u7684\u5f62\u5f0f\u6765\u5b58\u50a8\u6700\u5927\u5806\u7684\u503c\uff0c\u4ece1\u53f7\u5355\u5143\u5f00\u59cb\u5b58\u50a8\uff0c\u56e0\u6b64\u7236\u7ed3\u70b9\u8ddf\u5b50\u7ed3\u70b9\u7684\u5173\u7cfb\u5c31\u662f\u4e24\u500d\u7684\u5173\u7cfb\u3002<\/p>\n

\u5373\uff1aheap[father * 2] = heap[leftChild]; \u00a0heap[father * 2 + 1] = heap[rightChild];<\/p>\n

\u6700\u5927\u5806\u7684\u521d\u59cb\u5316<\/p>\n

\u5728\u751f\u6210\u6700\u5927\u5806\u65f6\uff0c\u6211\u4eec\u53ef\u4ee5\u91c7\u53d6\u4e00\u6b21\u6b21\u904d\u5386\u6574\u68f5\u6811\u627e\u5230\u6700\u5927\u7684\u7ed3\u70b9\u653e\u5230\u76f8\u5e94\u7684\u4f4d\u7f6e\u4e2d\u3002<\/p>\n

\u4f46\u662f\u8fd9\u79cd\u65b9\u6cd5\u6709\u4e2a\u4e0d\u597d\u7684\u5730\u65b9\uff0c\u5c31\u662f\u6bcf\u4e2a\u7ed3\u70b9\u90fd\u8981\u91cd\u590d\u6bd4\u8f83\u591a\u6b21\u3002<\/p>\n

\u6240\u4ee5\u6211\u4eec\u53ef\u4ee5\u6362\u4e00\u79cd\u601d\u8003\u7684\u987a\u5e8f\uff0c\u4ece\u4e0b\u5f80\u4e0a\u8fdb\u884c\u6bd4\u8f83\u3002\u5148\u627e\u5230\u6700\u540e\u4e00\u4e2a\u6709\u5b50\u7ed3\u70b9\u7684\u7ed3\u70b9\uff0c\u5148\u8ba9\u4ed6\u7684\u4e24\u4e2a\u5b50\u7ed3\u70b9\u8fdb\u884c\u6bd4\u8f83\uff0c\u627e\u5230\u5927\u7684\u503c\u518d\u548c\u7236\u7ed3\u70b9\u7684\u503c\u8fdb\u884c\u6bd4\u8f83\u3002\u5982\u679c\u7236\u7ed3\u70b9\u7684<\/p>\n

\u503c\u5c0f\uff0c\u5219\u5b50\u7ed3\u70b9\u548c\u7236\u7ed3\u70b9\u8fdb\u884c\u4ea4\u6362\uff0c\u4ea4\u6362\u4e4b\u540e\u518d\u5f80\u4e0b\u6bd4\u8f83\u3002\u7136\u540e\u4e00\u6b65\u6b65\u9012\u5f52\u4e0a\u53bb\uff0c\u77e5\u9053\u6240\u5728\u7ed3\u70b9\u7684\u4f4d\u7f6e\u662f0\u53f7\u4f4d\u7f6e\u8df3\u51fa\u3002\u8fd9\u6837\u5c31\u53ef\u4ee5\u6709\u6548\u5730\u51cf\u5c11\u6bd4\u8f83\u6240\u7528\u5230\u7684\u65f6\u95f4\u3002<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

\u4f46\u662f\u6bcf\u4e00\u6b21\u4ea4\u6362\u90fd\u8981\u91cd\u590d\u4e09\u6b65\uff1aheap[i] = temp; heap[i] = heap[j]; heap[j] = temp;<\/p>\n

\u5f53\u6811\u7684\u7ed3\u6784\u6bd4\u8f83\u5927\u7684\u65f6\u5019\uff0c\u5c31\u4f1a\u6d6a\u8d39\u5f88\u591a\u65f6\u95f4\u3002<\/p>\n

\u6240\u4ee5\u6211\u4eec\u53ef\u4ee5\u5148\u628a\u7236\u7ed3\u70b9\u7684\u503c\u5b58\u5230temp\u4e2d\u8ddf\u5b50\u7ed3\u70b9\u6bd4\u8f83\uff0c\u5982\u679c\u5b50\u7ed3\u70b9\u5927\u7684\u8bdd\u5c31\u628a\u5b50\u7ed3\u70b9\u7684\u503c\u8d4b\u503c\u7ed9\u7236\u7ed3\u70b9\uff0c\u518d\u5f80\u4e0b\u6bd4\u8f83\uff0c\u6700\u540e\u624d\u628atemp\u7684\u503c\u5b58\u5230\u76f8\u5e94\u7684\u4f4d\u7f6e\u3002<\/p>\n

\"\"<\/p>\n

\"\"<\/p>\n

<\/code><\/pre>\n
    \n
  1. \n
    \n
    <\/div>\n<\/div>\n
    \n
    void Initialize<\/span>(T<\/span> a[], int size, int ArraySize<\/span>)<\/div>\n<\/div>\n<\/li>\n
  2. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  3. \n
    \n
    <\/div>\n<\/div>\n
    \n
    delete []heap;<\/div>\n<\/div>\n<\/li>\n
  4. \n
    \n
    <\/div>\n<\/div>\n
    \n
    isExist = false<\/span>;<\/div>\n<\/div>\n<\/li>\n
  5. \n
    \n
    <\/div>\n<\/div>\n
    \n
    heap = a;<\/div>\n<\/div>\n<\/li>\n
  6. \n
    \n
    <\/div>\n<\/div>\n
    \n
    CurrentSize<\/span> = size;<\/div>\n<\/div>\n<\/li>\n
  7. \n
    \n
    <\/div>\n<\/div>\n
    \n
    MaxSize<\/span> = ArraySize<\/span>;<\/div>\n<\/div>\n<\/li>\n
  8. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u4ea7\u751f\u4e00\u4e2a\u6700\u5927\u5806<\/span><\/div>\n<\/div>\n<\/li>\n
  9. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span>(int i = CurrentSize<\/span> \/ 2<\/span>; i >= 1<\/span>; i –)<\/div>\n<\/div>\n<\/li>\n
  10. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  11. \n
    \n
    <\/div>\n<\/div>\n
    \n
    T<\/span> y = heap[i]; \/\/\u5b50\u6811\u7684\u6839<\/span><\/div>\n<\/div>\n<\/li>\n
  12. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u5bfb\u627e\u653e\u7f6ey\u7684\u4f4d\u7f6e<\/span><\/div>\n<\/div>\n<\/li>\n
  13. \n
    \n
    <\/div>\n<\/div>\n
    \n
    int c<\/span> = 2<\/span> * i; \/\/c\u7684\u7236\u8282\u70b9\u662fy\u7684\u76ee\u6807\u4f4d\u7f6e<\/span><\/div>\n<\/div>\n<\/li>\n
  14. \n
    \n
    <\/div>\n<\/div>\n
    \n
    while<\/span>(c<\/span> <= CurrentSize<\/span>)<\/div>\n<\/div>\n<\/li>\n
  15. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  16. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/heap[c\uff3d\u5e94\u662f\u8f83\u5927\u7684\u540c\u80de\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
  17. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span>(c<\/span> < CurrentSize<\/span> && heap[c<\/span>] < heap[c<\/span> + 1<\/span>])<\/div>\n<\/div>\n<\/li>\n
  18. \n
    \n
    <\/div>\n<\/div>\n
    \n
    c<\/span> ++;<\/div>\n<\/div>\n<\/li>\n
  19. \n
    \n
    <\/div>\n<\/div>\n
    \n
    \/\/\u80fd\u628ay\u653e\u5165heap[c \/ 2]\u5417\uff1f<\/span><\/div>\n<\/div>\n<\/li>\n
  20. \n
    \n
    <\/div>\n<\/div>\n
    \n
    if<\/span>(y >= heap[c<\/span>])<\/div>\n<\/div>\n<\/li>\n
  21. \n
    \n
    <\/div>\n<\/div>\n
    \n
    break<\/span>; \/\/\u80fd <\/span><\/div>\n<\/div>\n<\/li>\n
  22. \n
    \n
    <\/div>\n<\/div>\n
    \n
    else<\/span> \/\/\u4e0d\u80fd<\/span><\/div>\n<\/div>\n<\/li>\n
  23. \n
    \n
    <\/div>\n<\/div>\n
    \n
    {<\/div>\n<\/div>\n<\/li>\n
  24. \n
    \n
    <\/div>\n<\/div>\n
    \n
    heap[c<\/span> \/ 2<\/span>] = heap[c<\/span>]; \/\/\u5c06\u5b69\u5b50\u4e0a\u79fb<\/span><\/div>\n<\/div>\n<\/li>\n
  25. \n
    \n
    <\/div>\n<\/div>\n
    \n
    c<\/span> *= 2<\/span>;<\/div>\n<\/div>\n<\/li>\n
  26. \n
    \n
    <\/div>\n<\/div>\n
    \n
    } \/\/\u4e0b\u79fb\u4e00\u5c42<\/span><\/div>\n<\/div>\n<\/li>\n
  27. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  28. \n
    \n
    <\/div>\n<\/div>\n
    \n
    heap[c<\/span> \/ 2<\/span>] = y;<\/div>\n<\/div>\n<\/li>\n
  29. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  30. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
    <\/code><\/pre>\n
    \u6700\u5927\u5806\u7684\u63d2\u5165<\/p>\n
    \u6700\u5927\u5806\u7684\u63d2\u5165\u7684\u601d\u60f3\u5c31\u662f\u5148\u5728\u6700\u540e\u7684\u7ed3\u70b9\u6dfb\u52a0\u4e00\u4e2a\u5143\u7d20\uff0c\u7136\u540e\u6cbf\u7740\u6811\u4e0a\u5347\u3002\u8ddf\u6700\u5927\u5806\u7684\u521d\u59cb\u5316\u5927\u81f4\u76f8\u540c\u3002<\/p>\n
    <\/code><\/pre>\n
      \n
    1. \n
      \n
      <\/div>\n<\/div>\n
      \n
      MaxHeap<T> &Insert(const<\/span> T&x)<\/div>\n<\/div>\n<\/li>\n
    2. \n
      \n
      <\/div>\n<\/div>\n
      \n
      {<\/div>\n<\/div>\n<\/li>\n
    3. \n
      \n
      <\/div>\n<\/div>\n
      \n
      if<\/span>(CurrentSize == MaxSize)<\/div>\n<\/div>\n<\/li>\n
    4. \n
      \n
      <\/div>\n<\/div>\n
      \n
      exit<\/span>(1<\/span>); \/\/\u6ca1\u6709\u8db3\u591f\u7a7a\u95f4<\/span><\/div>\n<\/div>\n<\/li>\n
    5. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    6. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/\u4e3ax\u5bfb\u627e\u5e94\u63d2\u5165\u4f4d\u7f6e<\/span><\/div>\n<\/div>\n<\/li>\n
    7. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/i\u4ece\u65b0\u7684\u53f6\u8282\u70b9\u5f00\u59cb\uff0c\u5e76\u6cbf\u7740\u6811\u4e0a\u5347<\/span><\/div>\n<\/div>\n<\/li>\n
    8. \n
      \n
      <\/div>\n<\/div>\n
      \n
      int<\/span> i = ++ CurrentSize;<\/div>\n<\/div>\n<\/li>\n
    9. \n
      \n
      <\/div>\n<\/div>\n
      \n
      while<\/span>(i != 1<\/span> && x > heap[i\/2<\/span>])<\/div>\n<\/div>\n<\/li>\n
    10. \n
      \n
      <\/div>\n<\/div>\n
      \n
      {<\/div>\n<\/div>\n<\/li>\n
    11. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/\u4e0d\u628ax\u653e\u8fdbheap[i]<\/span><\/div>\n<\/div>\n<\/li>\n
    12. \n
      \n
      <\/div>\n<\/div>\n
      \n
      heap[i] = heap[i\/2<\/span>]; \/\/\u5143\u7d20\u4e0b\u79fb<\/span><\/div>\n<\/div>\n<\/li>\n
    13. \n
      \n
      <\/div>\n<\/div>\n
      \n
      i \/= 2<\/span>; \/\/\u79fb\u5411\u7236\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
    14. \n
      \n
      <\/div>\n<\/div>\n
      \n
      }<\/div>\n<\/div>\n<\/li>\n
    15. \n
      \n
      <\/div>\n<\/div>\n
      \n
      heap[i] = x; \/\/\u8fd9\u65f6\u5019\u624d\u628ax\u653e\u8fdb\u53bb<\/span><\/div>\n<\/div>\n<\/li>\n
    16. \n
      \n
      <\/div>\n<\/div>\n
      \n
      return<\/span> *this<\/span>;<\/div>\n<\/div>\n<\/li>\n
    17. \n
      \n
      <\/div>\n<\/div>\n
      \n
      }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
      <\/code><\/pre>\n
      \u6700\u5927\u5806\u7684\u5220\u9664\u6700\u5927\u5806\u7684\u5220\u9664\uff0c\u5373\u5220\u9664\u6700\u5927\u7684\u5143\u7d20\u3002\u6211\u4eec\u5148\u53d6\u6700\u540e\u7684\u5143\u7d20\u63d0\u5230\u6839\u7ed3\u70b9\uff0c\u7136\u540e\u5220\u9664\u6700\u5927\u503c\uff0c\u7136\u540e\u518d\u628a\u65b0\u7684\u6839\u8282\u70b9\u653e\u5230\u5408\u9002\u7684\u4f4d\u7f6e<\/p>\n
      <\/code><\/pre>\n
        \n
      1. \n
        \n
        <\/div>\n<\/div>\n
        \n
        MaxHeap<T> &DeleteMax(T &x)<\/div>\n<\/div>\n<\/li>\n
      2. \n
        \n
        <\/div>\n<\/div>\n
        \n
        {<\/div>\n<\/div>\n<\/li>\n
      3. \n
        \n
        <\/div>\n<\/div>\n
        \n
        \/\/\u68c0\u67e5\u5806\u662f\u5426\u4e3a\u7a7a<\/span><\/div>\n<\/div>\n<\/li>\n
      4. \n
        \n
        <\/div>\n<\/div>\n
        \n
        if<\/span>(CurrentSize == 0<\/span>)<\/div>\n<\/div>\n<\/li>\n
      5. \n
        \n
        <\/div>\n<\/div>\n
        \n
        exit(1<\/span>); \/\/\u961f\u5217\u7a7a<\/span><\/div>\n<\/div>\n<\/li>\n
      6. \n
        \n
        <\/div>\n<\/div>\n
        \n
        <\/div>\n<\/div>\n<\/li>\n
      7. \n
        \n
        <\/div>\n<\/div>\n
        \n
        x = heap[1<\/span>]; \/\/\u6700\u5927\u5143\u7d20<\/span><\/div>\n<\/div>\n<\/li>\n
      8. \n
        \n
        <\/div>\n<\/div>\n
        \n
        T y = heap[CurrentSize–]; \/\/\u6700\u540e\u4e00\u4e2a\u5143\u7d20<\/span><\/div>\n<\/div>\n<\/li>\n
      9. \n
        \n
        <\/div>\n<\/div>\n
        \n
        \/\/\u4ece\u6839\u5f00\u59cb\uff0c\u91cd\u6784\u5927\u5806<\/span><\/div>\n<\/div>\n<\/li>\n
      10. \n
        \n
        <\/div>\n<\/div>\n
        \n
        int i = 1<\/span>, ci = 2<\/span>; \/\/ci\u4e3ai\u7684\u513f\u5b50<\/span><\/div>\n<\/div>\n<\/li>\n
      11. \n
        \n
        <\/div>\n<\/div>\n
        \n
        while<\/span>(ci < CurrentSize)<\/div>\n<\/div>\n<\/li>\n
      12. \n
        \n
        <\/div>\n<\/div>\n
        \n
        {<\/div>\n<\/div>\n<\/li>\n
      13. \n
        \n
        <\/div>\n<\/div>\n
        \n
        if<\/span>(ci < CurrentSize && heap[ci] < heap[ci + 1<\/span>]) \/\/\u6bd4\u8f83\u4e24\u4e2a\u5b50\u8282\u70b9\u5927\u5c0f\uff0c\u53d6\u5176\u5927<\/span><\/div>\n<\/div>\n<\/li>\n
      14. \n
        \n
        <\/div>\n<\/div>\n
        \n
        ci ++;<\/div>\n<\/div>\n<\/li>\n
      15. \n
        \n
        <\/div>\n<\/div>\n
        \n
        \/\/\u80fd\u5426\u653ey<\/span><\/div>\n<\/div>\n<\/li>\n
      16. \n
        \n
        <\/div>\n<\/div>\n
        \n
        if<\/span>(heap[ci] > y) \/\/\u4e0d\u80fd<\/span><\/div>\n<\/div>\n<\/li>\n
      17. \n
        \n
        <\/div>\n<\/div>\n
        \n
        {<\/div>\n<\/div>\n<\/li>\n
      18. \n
        \n
        <\/div>\n<\/div>\n
        \n
        heap[i] = heap[ci]; \/\/\u5b69\u5b50\u4e0a\u79fb<\/span><\/div>\n<\/div>\n<\/li>\n
      19. \n
        \n
        <\/div>\n<\/div>\n
        \n
        i = ci; \/\/\u4e0b\u79fb\u4e00\u5c42<\/span><\/div>\n<\/div>\n<\/li>\n
      20. \n
        \n
        <\/div>\n<\/div>\n
        \n
        ci *= 2<\/span>;<\/div>\n<\/div>\n<\/li>\n
      21. \n
        \n
        <\/div>\n<\/div>\n
        \n
        }<\/div>\n<\/div>\n<\/li>\n
      22. \n
        \n
        <\/div>\n<\/div>\n
        \n
        else<\/span> \/\/\u80fd<\/span><\/div>\n<\/div>\n<\/li>\n
      23. \n
        \n
        <\/div>\n<\/div>\n
        \n
        break<\/span>;<\/div>\n<\/div>\n<\/li>\n
      24. \n
        \n
        <\/div>\n<\/div>\n
        \n
        }<\/div>\n<\/div>\n<\/li>\n
      25. \n
        \n
        <\/div>\n<\/div>\n
        \n
        heap[i] = y;<\/div>\n<\/div>\n<\/li>\n
      26. \n
        \n
        <\/div>\n<\/div>\n
        \n
        return<\/span> *this<\/span>;<\/div>\n<\/div>\n<\/li>\n
      27. \n
        \n
        <\/div>\n<\/div>\n
        \n
        }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
        <\/code><\/pre>\n<\/div>\n<\/div>\n<\/article>\n","protected":false},"excerpt":{"rendered":"
        \u539f\u6587\u5730\u5740 \u6700\u5927\u5806\u548c\u6700\u5c0f\u5806\u662f\u4e8c\u53c9\u5806\u7684\u4e24\u79cd\u5f62<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"colormag_page_container_layout":"default_layout","colormag_page_sidebar_layout":"default_layout","footnotes":""},"categories":[],"tags":[119],"class_list":["post-3737","post","type-post","status-publish","format-standard","hentry","tag-03-"],"_links":{"self":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts\/3737","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/comments?post=3737"}],"version-history":[{"count":0,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts\/3737\/revisions"}],"wp:attachment":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/media?parent=3737"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/categories?post=3737"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/tags?post=3737"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}