{"id":870,"date":"2021-03-09T01:16:34","date_gmt":"2021-03-08T17:16:34","guid":{"rendered":"http:\/\/lonelinerd.com\/?p=870"},"modified":"2022-10-16T19:25:34","modified_gmt":"2022-10-16T11:25:34","slug":"reading-notes-csharp-algorithm-2","status":"publish","type":"post","link":"https:\/\/lonelinerd.com\/index.php\/2021\/03\/09\/reading-notes-csharp-algorithm-2\/","title":{"rendered":"\u300a\u5716\u8aaa\u6f14\u7b97\u6cd5-\u4f7f\u7528C#\u300b\u8981\u9ede\u6458\u9304 – \u300c\u5e38\u898b\u6f14\u7b97\u6cd5\u300d"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t
\n\t\t\t\t

\u66f8\u540d\uff1a\u300a\u5716\u8aaa\u6f14\u7b97\u6cd5-\u4f7f\u7528C#\u300b<\/b><\/p>

\u4f5c\u8005\uff1a\u5433\u71e6\u9298\u3001\u80e1\u662d\u6c11<\/strong><\/p>

\u6240\u8b80\u7248\u672c\uff1a\u535a\u78a9\u6587\u5316<\/p>\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\n\t\t\t\t\t\t<\/span>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t
\n\t\t\t\t

\u5206\u6cbb\u6cd5<\/span><\/strong><\/span><\/h4>

  • \u53cd\u8986\u5206\u5272\u554f\u984c\uff0c\u4f7f\u5b50\u554f\u984c\u898f\u6a21\u4e0d\u65b7\u7e2e\u5c0f<\/span>\uff0c\u76f4\u5230\u9019\u4e9b\u5b50\u554f\u984c\u8db3\u5920\u7c21\u55ae\u5230\u53ef\u4ee5\u89e3\u6c7a\uff0c\u6700\u5f8c\u5c07\u5404\u5b50\u554f\u984c\u7684\u89e3\u5408\u4f75\u5f97\u5230\u539f\u554f\u984c\u7684\u89e3\u7b54<\/span><\/p><\/li><\/ul>

    \u905e\u6b78<\/span><\/strong><\/span><\/h4>

    • \u4e00\u500b\u51fd\u6578\u7531\u81ea\u8eab\u5b9a\u7fa9\u6216\u547c\u53eb<\/span><\/p><\/li>

    • \u5fc5\u9808\u8981\u67092\u500b\u689d\u4ef6<\/span><\/p>

      • \u4e2d\u6b62\u905e\u6b78\u51fa\u53e3<\/span><\/p><\/li>

      • \u905e\u6b78\u57f7\u884c\u904e\u7a0b<\/span><\/p><\/li><\/ul><\/li><\/ul>

        • \u4f8b\u5b50\uff1a\u83f2\u6ce2\u90a3\u5951\u6578\u5217<\/span><\/p>

          • public<\/span> static<\/span> int<\/span> Fibonacci<\/span>(int<\/span> idx<\/span>)<\/span>
            {<\/span>
             \u00a0 \u00a0if<\/span> (idx<\/span> ==<\/span> 0<\/span>) { return<\/span> 0<\/span>; }<\/span>
             \u00a0 \u00a0else<\/span> if<\/span> (idx<\/span> ==<\/span> 1<\/span>) { return<\/span> 1<\/span>; }<\/span>
             \u00a0 \u00a0else<\/span> { return<\/span> Fibonacci<\/span>(idx<\/span> -<\/span> 1<\/span>) +<\/span> Fibonacci<\/span>(idx<\/span> -<\/span> 2<\/span>); }<\/span>
            }<\/span><\/pre><\/li><\/ul><\/li><\/ul>
            \u52d5\u614b\u898f\u5283\uff08Dynamic Programming\uff09<\/span><\/strong><\/span><\/h4>
            • \u985e\u4f3c\u5206\u6cbb\u6cd5\uff0c\u4f46\u6703\u5229\u7528\u67d0\u7a2e\u6578\u64da\u7d50\u69cb\u5c07\u5b50\u554f\u984c\u7684\u89e3\u4fdd\u5b58\u8d77\u4f86<\/span><\/span><\/p><\/li>
            • \u7576\u89e3\u6c7a\u4e00\u6a23\u7684\u5b50\u554f\u984c\u6642\uff0c\u5c31\u53ef\u4ee5\u76f4\u63a5\u5f9e\u6578\u64da\u7d50\u69cb\u4e2d\u5f97\u5230\u5b50\u554f\u984c\u7684\u89e3\u4e26\u8fd4\u56de\uff0c\u800c\u4e0d\u9700\u8981\u91cd\u65b0\u89e3\u6c7a\u4e00\u6b21\u5b50\u554f\u984c\u3002<\/span><\/p><\/li>
            • \u4f8b\u5b50\uff1a\u512a\u5316\u7684\u83f2\u6ce2\u90a3\u5951\u6578\u5217<\/span><\/p>
              • static<\/span> Dictionary<\/span><<\/span>int<\/span>, int<\/span>><\/span> fibonacciResultMemo<\/span> =<\/span> new<\/span> Dictionary<\/span><<\/span>int<\/span>, int<\/span>><\/span>()<\/span>
                {<\/span>
                 \u00a0  {0<\/span>, 0<\/span> },<\/span>
                 \u00a0  {1<\/span>, 1<\/span> }<\/span>
                };<\/span>
                \u200b<\/span>
                public<\/span> static<\/span> int<\/span> Fibonacci<\/span>(int<\/span> idx<\/span>)<\/span>
                {<\/span>
                 \u00a0 \u00a0if<\/span> (fibonacciResultMemo<\/span>.ContainsKey<\/span>(idx<\/span>)) { return<\/span> fibonacciResultMemo<\/span>[idx<\/span>]; }<\/span>
                 \u00a0 \u00a0else<\/span><\/span>
                 \u00a0  {<\/span>
                 \u00a0 \u00a0 \u00a0 \u00a0int<\/span> res<\/span> =<\/span> Fibonacci<\/span>(idx<\/span> -<\/span> 1<\/span>) +<\/span> Fibonacci<\/span>(idx<\/span> -<\/span> 2<\/span>);<\/span>
                 \u00a0 \u00a0 \u00a0 \u00a0fibonacciResultMemo<\/span>.Add<\/span>(idx<\/span>, res<\/span>);<\/span>
                 \u00a0 \u00a0 \u00a0 \u00a0return<\/span> res<\/span>;<\/span>
                 \u00a0  }<\/span>
                }<\/span><\/pre><\/li><\/ul><\/li><\/ul>
                \u8fed\u4ee3<\/span><\/strong><\/span><\/h4>
                • \u7d50\u679c\u7121\u6cd5\u7528\u516c\u5f0f\u4e00\u6b21\u6c42\u89e3\uff0c\u9700\u8981\u5229\u7528\u8ff4\u5708\u53cd\u8986\u904b\u7b97<\/span><\/p><\/li>
                • \u8ff4\u5708\u7d50\u69cb\u7684\u4e09\u500b\u689d\u4ef6\uff1a<\/span><\/p>
                  • \u6a19\u8a18\u8ff4\u5708\u8d77\u9ede\u548c\u9032\u5ea6\u7684\u8b8a\u6578<\/span><\/p><\/li>
                  • \u5faa\u74b0\u689d\u4ef6<\/span><\/p><\/li>
                  • \u8ff4\u5708\u8b8a\u6578\u7684\u589e\u6e1b\u503c<\/span><\/p><\/li><\/ul><\/li>
                  • \u4f8b\u5b50\uff1a\u8a08\u7b97\u968e\u5c64<\/span><\/p>
                    • public<\/span> static<\/span> int<\/span> Stairs<\/span>(int<\/span> targetStair<\/span>)<\/span>
                      {<\/span>
                       \u00a0 \u00a0int<\/span> sum<\/span> =<\/span> 1<\/span>;<\/span>
                       \u00a0 \u00a0for<\/span> (int<\/span> i<\/span> =<\/span> 0<\/span>; i<\/span> <=<\/span> targetStair<\/span>; i<\/span>++<\/span>)<\/span>
                       \u00a0  {<\/span>
                       \u00a0 \u00a0 \u00a0 \u00a0sum<\/span> =<\/span> 1<\/span>;<\/span>
                       \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> j<\/span> =<\/span> i<\/span>; j<\/span> ><\/span> 0<\/span>; j<\/span>--<\/span>)<\/span>
                       \u00a0 \u00a0 \u00a0  {<\/span>
                       \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0sum<\/span> =<\/span> sum<\/span> *<\/span> j<\/span>;<\/span>
                       \u00a0 \u00a0 \u00a0  }<\/span>
                       \u00a0  }<\/span>
                       \u00a0 \u00a0return<\/span> sum<\/span>;<\/span>
                      }<\/span><\/pre><\/li><\/ul><\/li><\/ul>
                      Pascal’s Triangle<\/span><\/strong><\/span><\/h4>
                      • rC0 = 1 => \u6bcf\u4e00\u5217\u7684\u7b2c0\u6b04\u7684\u503c\u4e00\u5b9a\u70ba1<\/span><\/p><\/li><\/ul>
                        • rCn = rCn-1 * (r – n + 1)\/n => \u67d0\u6b04\u67d0\u5217\u5143\u7d20\u503c\u516c\u5f0f<\/span><\/p>
                          • r = row<\/span><\/p><\/li>
                          • n = column<\/span><\/p><\/li><\/ul><\/li><\/ul>
                            \u56de\u6eaf\u6cd5<\/span><\/strong><\/span><\/h4>
                            • \u7aae\u8209\u6cd5\u7684\u4e00\u7a2e\uff0c\u4f46\u5728\u767c\u73fe\u76ee\u6a19\u4e0d\u6b63\u78ba\u5f8c\u99ac\u4e0a\u8fd4\u56de\u4e0a\u4e00\u5c64\uff0c\u800c\u4e0d\u905e\u6b78\u5230\u4e0b\u4e00\u5c64<\/span><\/span><\/p>
                              • \u4f5c\u8005\u7684\u4f8b\u5b50\u662f\u53ea\u80fd\u5c40\u9650\u5728\u77e5\u9053\u7d42\u9ede\u5728\u8d77\u9ede\u7684\u65b9\u4f4d\uff08\u53f3\u4e0b\u89d2\uff09\u7684\u524d\u63d0\u4e0b\u624d\u80fd\u751f\u6548\u7684\uff0c\u4f46\u5982\u679c\u4e0d\u77e5\u9053\u8d77\u3001\u7d42\u9ede\u7684\u4f4d\u7f6e\uff0c\u5be6\u969b\u4e0a\u53ea\u80fd\u4f7f\u7528DFS\u9032\u884c\u641c\u7d22\u3002<\/span><\/p><\/li>
                              • \u4fee\u6539\u7248\uff1a<\/span><\/p>
                                • static<\/span> void<\/span> Main<\/span>(string<\/span>[] args<\/span>)<\/span>
                                  {<\/span>
                                   \u00a0  (int<\/span> x<\/span>, int<\/span> y<\/span>) start<\/span> =<\/span> (1<\/span>, 1<\/span>);<\/span>
                                   \u00a0  (int<\/span> x<\/span>, int<\/span> y<\/span>) exit<\/span> =<\/span> (8<\/span>, 2<\/span>);<\/span>
                                   \u00a0 \u00a0int<\/span>[,] maze<\/span> =<\/span> new<\/span> int<\/span>[10<\/span>, 12<\/span>]<\/span>
                                   \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span>, 0<\/span>, 1<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 0<\/span>, 1<\/span>, 0<\/span>, 0<\/span>, 1<\/span> },<\/span>
                                   \u00a0 \u00a0 \u00a0  {1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span>, 1<\/span> }<\/span>
                                   \u00a0  };<\/span>
                                  \u200b<\/span>
                                   \u00a0 \u00a0FindPathInMaze<\/span>(start<\/span>, exit<\/span>, maze<\/span>);<\/span>
                                  \u200b<\/span>
                                   \u00a0 \u00a0Console<\/span>.WriteLine<\/span>();<\/span>
                                  }<\/span>
                                  public<\/span> static<\/span> void<\/span> FindPathInMaze<\/span>((int<\/span> x<\/span>, int<\/span> y<\/span>) startPos<\/span>, (int<\/span> x<\/span>, int<\/span> y<\/span>) goalPos<\/span>, int<\/span>[,] maze<\/span>)<\/span>
                                  {<\/span>
                                   \u00a0 \u00a0Stack<\/span><<\/span>(int<\/span> x<\/span>, int<\/span> y<\/span>)><\/span> pathStack<\/span> =<\/span> new<\/span> Stack<\/span><<\/span>(int<\/span> x<\/span>, int<\/span> y<\/span>)><\/span>();<\/span>
                                   \u00a0 \u00a0pathStack<\/span>.Push<\/span>(startPos<\/span>);<\/span>
                                  \u200b<\/span>
                                   \u00a0 \u00a0while<\/span> (pathStack<\/span>.Count<\/span> ><\/span> 0<\/span>)<\/span>
                                   \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0  (int<\/span> x<\/span>, int<\/span> y<\/span>) currPath<\/span> =<\/span> pathStack<\/span>.Pop<\/span>();<\/span>
                                  \u200b<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0\/\/Reach Goal, Break Loop<\/span><\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (currPath<\/span>.x<\/span> ==<\/span> goalPos<\/span>.x<\/span> &&<\/span> currPath<\/span>.y<\/span> ==<\/span> goalPos<\/span>.y<\/span>)<\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0maze<\/span>[currPath<\/span>.x<\/span>, currPath<\/span>.y<\/span>] =<\/span> 2<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0break<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                  \u200b<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0\/\/Set Current <\/span><\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0maze<\/span>[currPath<\/span>.x<\/span>, currPath<\/span>.y<\/span>] =<\/span> 2<\/span>;<\/span>
                                  \u200b<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (maze<\/span>[currPath<\/span>.x<\/span> -<\/span> 1<\/span>, currPath<\/span>.y<\/span>] ==<\/span> 0<\/span>)<\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0pathStack<\/span>.Push<\/span>((currPath<\/span>.x<\/span> -<\/span> 1<\/span>, currPath<\/span>.y<\/span>));<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (maze<\/span>[currPath<\/span>.x<\/span> +<\/span> 1<\/span>, currPath<\/span>.y<\/span>] ==<\/span> 0<\/span>)<\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0pathStack<\/span>.Push<\/span>((currPath<\/span>.x<\/span> +<\/span> 1<\/span>, currPath<\/span>.y<\/span>));<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (maze<\/span>[currPath<\/span>.x<\/span>, currPath<\/span>.y<\/span> +<\/span> 1<\/span>] ==<\/span> 0<\/span>)<\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0pathStack<\/span>.Push<\/span>((currPath<\/span>.x<\/span>, currPath<\/span>.y<\/span> +<\/span> 1<\/span>));<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (maze<\/span>[currPath<\/span>.x<\/span>, currPath<\/span>.y<\/span> -<\/span> 1<\/span>] ==<\/span> 0<\/span>)<\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0pathStack<\/span>.Push<\/span>((currPath<\/span>.x<\/span>, currPath<\/span>.y<\/span> -<\/span> 1<\/span>));<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0  }<\/span>
                                  }<\/span><\/pre><\/li><\/ul><\/li><\/ul><\/li><\/ul>
                                  \u8caa\u5fc3\u7b97\u6cd5<\/span><\/strong><\/span><\/h4>
                                  • \u53ea\u8003\u616e\u5c40\u90e8\u800c\u4e0d\u8003\u616e\u5927\u5c40<\/span>\uff0c\u901a\u904e\u6bcf\u4e00\u6b21\u8a08\u7b97\u90fd\u9078\u64c7\u7576\u524d\u6700\u597d\u7684\u9078\u64c7\uff0c\u9010\u6b65\u903c\u8fd1\u76ee\u6a19<\/span><\/p><\/li>
                                  • \u4e0d\u80fd\u4fdd\u8b49\u6700\u5f8c\u7684\u89e3\u662f\u6700\u4f73\u89e3<\/span><\/p><\/li><\/ul>\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"
                                    \u66f8\u540d\uff1a\u300a\u5716\u8aaa\u6f14\u7b97\u6cd5-\u4f7f\u7528C#\u300b \u4f5c\u8005\uff1a\u5433\u71e6\u9298\u3001\u80e1\u662d\u6c11 \u6240\u8b80\u7248\u672c\uff1a\u535a\u78a9\u6587\u5316<\/p>\n","protected":false},"author":1,"featured_media":947,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3,18,21],"tags":[],"class_list":["post-870","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-reading-notes","category-developing","category-csharp-algorithm"],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/lonelinerd.com\/wp-content\/uploads\/2021\/03\/FeatureCover_ReadingNotes.png","_links":{"self":[{"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/870","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/comments?post=870"}],"version-history":[{"count":7,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/870\/revisions"}],"predecessor-version":[{"id":932,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/870\/revisions\/932"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/media\/947"}],"wp:attachment":[{"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/media?parent=870"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/categories?post=870"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/tags?post=870"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}