{"id":996,"date":"2021-03-22T23:32:15","date_gmt":"2021-03-22T15:32:15","guid":{"rendered":"http:\/\/lonelinerd.com\/?p=996"},"modified":"2022-10-16T19:24:55","modified_gmt":"2022-10-16T11:24:55","slug":"reading-notes-csharp-algorithm-6","status":"publish","type":"post","link":"https:\/\/lonelinerd.com\/index.php\/2021\/03\/22\/reading-notes-csharp-algorithm-6\/","title":{"rendered":"\u300a\u5716\u8aaa\u6f14\u7b97\u6cd5-\u4f7f\u7528C#\u300b\u8981\u9ede\u6458\u9304 \u2013 \u300c\u6578\u7d44\u8207\u93c8\u8868\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

\u6578\u7d44\u8207\u93c8\u8868<\/span><\/u><\/strong><\/span><\/h4>

  • \u6578\u7d44<\/span><\/p>

    • \u975c\u614b\u6578\u64da\u7d50\u69cb<\/span><\/p><\/li>

    • \u4f7f\u7528\u9023\u7e8c\u8a18\u61b6\u7a7a\u9593\u5132\u5b58<\/span><\/p><\/li>

    • \u522a\u9664\u548c\u63d2\u5165\u6642\u9700\u8981\u79fb\u52d5\u5927\u91cf\u8cc7\u6599<\/span><\/p><\/li>

    • \u8b80\u53d6\u8207\u4fee\u6539\u4efb\u4e00\u5143\u7d20\u70ba\u56fa\u5b9a\u6642\u9593<\/span><\/p><\/li><\/ul><\/li>

    • \u93c8\u8868<\/span><\/p>

      • \u52d5\u614b\u6578\u64da\u7d50\u69cb<\/span><\/p><\/li>

      • \u4e0d\u4f7f\u7528\u9023\u7e8c\u8a18\u61b6\u7a7a\u9593\u5132\u5b58<\/span><\/p><\/li>

      • \u522a\u9664\u548c\u63d2\u5165\u65b9\u4fbf\uff0c\u4e0d\u9700\u8981\u79fb\u52d5\u8cc7\u6599<\/span><\/p><\/li>

      • \u8b80\u53d6\u548c\u4fee\u6539\u90fd\u8981\u5148\u5faa\u5e8f\u627e\u5230\u8cc7\u6599\u70ba\u6b62<\/span><\/p><\/li><\/ul><\/li><\/ul>

        \u77e9\u9663\u52a0\u6cd5<\/span><\/u><\/strong><\/span><\/h4>

        • \u76f8\u52a0\u7684\u77e9\u9663\u4e4b\u9593\uff0c\u884c\u5217\u6578\u5fc5\u9808\u76f8\u7b49<\/span>\uff0c\u76f8\u52a0\u5f8c\u7684\u65b0\u77e9\u9663\u884c\u5217\u6578\u4e5f\u76f8\u7b49<\/span><\/p><\/li>

        • \u5c07\u6bcf\u500b\u5c0d\u61c9\u5750\u6a19\u7684\u5143\u7d20\u76f8\u52a0<\/span>\u5373\u53ef<\/span><\/p>

          • public<\/span> static<\/span> int<\/span>[,] Matrix_Add<\/span>(int<\/span>[,] A<\/span>, int<\/span>[,] B<\/span>)<\/span>
            {<\/span>
             \u00a0 \u00a0if<\/span>(A<\/span>.GetLength<\/span>(0<\/span>) !=<\/span> B<\/span>.GetLength<\/span>(0<\/span>) ||<\/span> A<\/span>.GetLength<\/span>(1<\/span>) !=<\/span> B<\/span>.GetLength<\/span>(1<\/span>))<\/span>
             \u00a0  {<\/span>
             \u00a0 \u00a0 \u00a0 \u00a0return<\/span> null<\/span>;<\/span>
             \u00a0  }<\/span>
            \u200b<\/span>
             \u00a0 \u00a0int<\/span>[,] res<\/span> =<\/span> new<\/span> int<\/span>[A<\/span>.GetLength<\/span>(0<\/span>), A<\/span>.GetLength<\/span>(1<\/span>)];<\/span>
            \u200b<\/span>
             \u00a0 \u00a0for<\/span> (int<\/span> i<\/span> =<\/span> 0<\/span>; i<\/span> <<\/span> A<\/span>.GetLength<\/span>(0<\/span>); i<\/span>++<\/span>)<\/span>
             \u00a0  {<\/span>
             \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> j<\/span> =<\/span> 0<\/span>; j<\/span> <<\/span> A<\/span>.GetLength<\/span>(1<\/span>); j<\/span>++<\/span>)<\/span>
             \u00a0 \u00a0 \u00a0  {<\/span>
             \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\/\/\u76f8\u540c\u5750\u6a19\u7684\u5143\u7d20\u76f8\u52a0\uff0c\u518d\u8ce6\u503c\u5728\u65b0\u77e9\u9663\u7684\u5c0d\u61c9\u5750\u6a19\u4e0a<\/span><\/span>
             \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0res<\/span>[i<\/span>, j<\/span>] =<\/span> A<\/span>[i<\/span>, j<\/span>] +<\/span> B<\/span>[i<\/span>, j<\/span>];<\/span>
             \u00a0 \u00a0 \u00a0  }<\/span>
             \u00a0  }<\/span>
            \u200b<\/span>
             \u00a0 \u00a0return<\/span> res<\/span>;<\/span>
            }<\/span><\/pre><\/li><\/ul><\/li><\/ul>
            \u77e9\u9663\u4e58\u6cd5<\/span><\/u><\/strong><\/span><\/h4>
            • \u8a2d\u77e9\u9663A \u9700\u8981\u4e58\u4ee5 \u77e9\u9663B\uff0c\u77e9\u9663A\u7684\u5217\u6578\u5fc5\u9808\u7b49\u77e9\u9663B\u7684\u884c\u6578\u3002\u7d50\u679c\u7684\u884c\u5217\u6578\u70ba\u77e9\u9663A\u7684\u884c\u6578\u548cB\u77e9\u9663\u7684\u5217\u6578<\/span><\/p>
              • A[m, n] * B[n, p] = AB[m, p]<\/span><\/p><\/li>
              • \u8a2dMa[2, 3], Mb[3, 2]<\/span><\/p>
                • \u7d50\u679c\u77e9\u9663\u4e2d\u7684\u6bcf\u500b\u5143\u7d20\u5247\u70ba\u5728A\u77e9\u9663\u4e0a\uff0c\u8a72\u5143\u7d20\u7684\u884c\u5750\u6a19\u4e0a\u6bcf\u4e00\u5217\u548cB\u77e9\u9663\u4e0a\uff0c\u8a72\u5143\u7d20\u7684\u5217\u5750\u6a19\u6bcf\u4e00\u884c\u5143\u7d20\u7684\u7a4d\u7684\u7e3d\u548c<\/span><\/p><\/li>
                • Mab[0, 0] = Sum(Ma[0, 0~2], Mb[0~2, 0])<\/span><\/p><\/li><\/ul><\/li><\/ul>
                  • public<\/span> static<\/span> int<\/span>[,] Matrix_Multiply<\/span>(int<\/span>[,] A<\/span>, int<\/span>[,] B<\/span>)<\/span>
                    {<\/span>
                     \u00a0 \u00a0if<\/span> (A<\/span>.GetLength<\/span>(1<\/span>) !=<\/span> B<\/span>.GetLength<\/span>(0<\/span>)) { return<\/span> null<\/span>; }<\/span>
                    \u200b<\/span>
                     \u00a0 \u00a0int<\/span> resCol<\/span> =<\/span> A<\/span>.GetLength<\/span>(0<\/span>);<\/span>
                     \u00a0 \u00a0int<\/span> resRow<\/span> =<\/span> B<\/span>.GetLength<\/span>(1<\/span>);<\/span>
                    \u200b<\/span>
                     \u00a0 \u00a0int<\/span> loopTime<\/span> =<\/span> A<\/span>.GetLength<\/span>(1<\/span>);<\/span>
                    \u200b<\/span>
                     \u00a0 \u00a0int<\/span>[,] res<\/span> =<\/span> new<\/span> int<\/span>[resCol<\/span>, resRow<\/span>];<\/span>
                    \u200b<\/span>
                     \u00a0 \u00a0for<\/span> (int<\/span> i<\/span> =<\/span> 0<\/span>; i<\/span> <<\/span> resCol<\/span>; i<\/span>++<\/span>)<\/span>
                     \u00a0  {<\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> j<\/span> =<\/span> 0<\/span>; j<\/span> <<\/span> resRow<\/span>; j<\/span>++<\/span>)<\/span>
                     \u00a0 \u00a0 \u00a0  {<\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0int<\/span> curr<\/span> =<\/span> 0<\/span>;<\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> k<\/span> =<\/span> 0<\/span>; k<\/span> <<\/span> loopTime<\/span>; k<\/span>++<\/span>)<\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\/\/res[i, j] = Sum of A[i, k] * B[k, j]<\/span><\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span> +=<\/span> A<\/span>[i<\/span>, k<\/span>] *<\/span> B<\/span>[k<\/span>, j<\/span>];<\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0res<\/span>[i<\/span>, j<\/span>] =<\/span> curr<\/span>;<\/span>
                     \u00a0 \u00a0 \u00a0  }<\/span>
                     \u00a0  }<\/span>
                    \u200b<\/span>
                     \u00a0 \u00a0return<\/span> res<\/span>;<\/span>
                    }<\/span><\/pre><\/li><\/ul><\/li><\/ul>
                    \u8f49\u7f6e\u77e9\u9663<\/span><\/u><\/span><\/strong><\/span><\/h4>
                    • \u539f\u77e9\u9663\u7684\u884c\u5750\u6a19\u5143\u7d20\u8207\u5217\u5750\u6a19\u5143\u7d20\u4e92\u63db\uff0c\u5982\u679cB\u662fA\u7684\u8f49\u7f6e\u77e9\u9663\uff0c\u5247B[i, j] = A[j, i]<\/span><\/span><\/p><\/li>
                    • public<\/span> static<\/span> int<\/span>[,] Matrix_Tranpose<\/span>(int<\/span>[,] A<\/span>)<\/span>
                      {<\/span>
                       \u00a0 \u00a0int<\/span>[,] res<\/span> =<\/span> new<\/span> int<\/span>[A<\/span>.GetLength<\/span>(0<\/span>), A<\/span>.GetLength<\/span>(1<\/span>)];<\/span>
                      \u200b<\/span>
                       \u00a0 \u00a0for<\/span> (int<\/span> i<\/span> =<\/span> 0<\/span>; i<\/span> <<\/span> res<\/span>.GetLength<\/span>(0<\/span>); i<\/span>++<\/span>)<\/span>
                       \u00a0  {<\/span>
                       \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> j<\/span> =<\/span> 0<\/span>; j<\/span> <<\/span> res<\/span>.GetLength<\/span>(1<\/span>); j<\/span>++<\/span>)<\/span>
                       \u00a0 \u00a0 \u00a0  {<\/span>
                       \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\/\/Tranpose<\/span><\/span>
                       \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0res<\/span>[i<\/span>, j<\/span>] =<\/span> A<\/span>[j<\/span>, i<\/span>];<\/span>
                       \u00a0 \u00a0 \u00a0  }<\/span>
                       \u00a0  }<\/span>
                      \u200b<\/span>
                       \u00a0 \u00a0return<\/span> res<\/span>;<\/span>
                      }<\/span><\/pre><\/li><\/ul>
                      \u7a00\u758f\u77e9\u9663<\/span><\/u><\/span><\/strong><\/span><\/h4>
                      • \u4e00\u500b\u77e9\u9663\u4e2d\u5927\u90e8\u5206\u7684\u5143\u7d20\u70ba0\uff0c\u4f7f\u7528\u50b3\u7d71\u7684\u4e8c\u7dad\u6578\u7d44\u53bb\u5132\u5b58\u6703\u5341\u5206\u6d6a\u8cbb\u7a7a\u9593\u3002<\/span><\/p><\/li>
                      • \u6539\u9032\u65b9\u6cd5\u662f\u5229\u7528\u4e09\u9805\u5f0f\uff0c\u628a\u77e9\u9663\u5167\u7684\u6bcf\u4e00\u500b\u975e\u96f6\u9805\u76ee\u4ee5\uff08\u884c\u5750\u6a19\u3001\u5217\u5750\u6a19\u3001\u503c\uff09\u7684\u65b9\u5f0f\u8868\u793a\u3002<\/span><\/p>
                        • \u5047\u5982\u77e9\u9663\u6709n\u500b\u975e\u96f6\u9805\u76ee\uff0c\u5176\u4e8c\u7dad\u6578\u503c\u53d6\u503c\u5247\u70ba\uff080:n, 1:3\uff09<\/span><\/p><\/li>
                        • A(0, 1) = \u77e9\u9663\u5217\u6578<\/span><\/p><\/li>
                        • A(0, 2) = \u77e9\u9663\u884c\u6578<\/span><\/p><\/li>
                        • A(0, 3) = \u975e\u96f6\u9805\u76ee\u7e3d\u6578<\/span><\/p><\/li>
                        • \u5f9eA(1) \u958b\u59cb\u5c31\u662f\u975e\u96f6\u9805\u76ee\u7684\u5177\u9ad4\u884c\u3001\u5217\u5750\u6a19\u548c\u503c\u4e86<\/span><\/p><\/li><\/ul><\/li>
                        • public<\/span> static<\/span> (int<\/span> x<\/span>, int<\/span> y<\/span>, int<\/span> val<\/span>)[] Matrix_Tranpose<\/span>(int<\/span>[,] A<\/span>)<\/span>
                          {<\/span>
                           \u00a0 \u00a0List<\/span><<\/span>(int<\/span> x<\/span>, int<\/span> y<\/span>, int<\/span> val<\/span>)><\/span> res<\/span> =<\/span> new<\/span> List<\/span><<\/span>(int<\/span> x<\/span>, int<\/span> y<\/span>, int<\/span> val<\/span>)><\/span>();<\/span>
                           \u00a0 \u00a0int<\/span> a_Col<\/span> =<\/span> A<\/span>.GetLength<\/span>(0<\/span>);<\/span>
                           \u00a0 \u00a0int<\/span> a_Row<\/span> =<\/span> A<\/span>.GetLength<\/span>(1<\/span>);<\/span>
                          \u200b<\/span>
                           \u00a0 \u00a0\/\/\u5b9a\u7fa9\u9996\u9805A(ColCount, RowCount, nonZeroCount)<\/span><\/span>
                           \u00a0 \u00a0res<\/span>.Add<\/span>((a_Col<\/span>, a_Row<\/span>, 0<\/span>));<\/span>
                          \u200b<\/span>
                           \u00a0 \u00a0for<\/span> (int<\/span> i<\/span> =<\/span> 0<\/span>; i<\/span> <<\/span> A<\/span>.GetLength<\/span>(0<\/span>); i<\/span>++<\/span>)<\/span>
                           \u00a0  {<\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> j<\/span> =<\/span> 0<\/span>; j<\/span> <<\/span> A<\/span>.GetLength<\/span>(1<\/span>); j<\/span>++<\/span>)<\/span>
                           \u00a0 \u00a0 \u00a0  {<\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(A<\/span>[i<\/span>, j<\/span>] !=<\/span> 0<\/span>)<\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\/\/Add nonZero element<\/span><\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0res<\/span>.Add<\/span>((i<\/span>, j<\/span>, A<\/span>[i<\/span>, j<\/span>]));<\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\/\/nonZeroCount++<\/span><\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0res<\/span>[0<\/span>] =<\/span> (a_Col<\/span>, a_Row<\/span>, res<\/span>[0<\/span>].val<\/span> +<\/span> 1<\/span>);<\/span>
                           \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
                           \u00a0 \u00a0 \u00a0  }<\/span>
                           \u00a0  }<\/span>
                          \u200b<\/span>
                           \u00a0 \u00a0return<\/span> res<\/span>.ToArray<\/span>();<\/span>
                          }<\/span><\/pre><\/li><\/ul>
                          \u55ae\u5411\u93c8\u8868\u7b97\u6cd5<\/span><\/strong><\/span><\/h4>
                          • \u55ae\u5411\u93c8\u8868\u4e0a\u7684\u6bcf\u4e00\u500b\u7bc0\u9ede\u9700\u8981\u4e00\u500b\u6307\u5411\u4e0b\u500b\u7bc0\u9ede\u7684\u6307\u91dd\u548c\u81f3\u5c11\u4e00\u500b\u6578\u64da\u6b04\u4f4d<\/span><\/span><\/p>
                            • \u901a\u904e\u8a2a\u554f\u7576\u524d\u7bc0\u9ede.next\u524d\u5f80\u4e0b\u4e00\u500b\u7bc0\u9ede<\/span><\/p><\/li><\/ul><\/li>
                            • \u53ea\u6709\u5b58\u5728\u6839\u7bc0\u9ede\u7684\u5f15\u7528\uff0c\u5c31\u53ef\u4ee5\u5c0d\u6574\u500b\u93c8\u8868\u9032\u884c\u8d70\u8a2a\u3001\u52a0\u5165\u3001\u522a\u9664\u7b49\u64cd\u4f5c\u3002\u56e0\u6b64\u76e1\u91cf\u4e0d\u8981\u79fb\u52d5\u6839\u7bc0\u9ede\u6307\u6a19<\/span><\/p><\/li>
                            • public<\/span> class<\/span> LinkedList<\/span><\/span>
                              {<\/span>
                               \u00a0 \u00a0public<\/span> StudentNode<\/span> root<\/span>;<\/span>
                              \u200b<\/span>
                               \u00a0 \u00a0public<\/span> void<\/span> Insert<\/span>(string<\/span> name<\/span>, int<\/span> score<\/span>)<\/span>
                               \u00a0  {<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0StudentNode<\/span> newStudent<\/span> =<\/span> new<\/span> StudentNode<\/span>(name<\/span>, score<\/span>);<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0StudentNode<\/span> curr<\/span> =<\/span> root<\/span>;<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0\/\/\u904d\u6b77\u5230\u93c8\u8868\u7d50\u5c3e\uff0c\u628a\u65b0\u7bc0\u9ede\u63d2\u5165\u5728\u5c3e\u90e8<\/span><\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0while<\/span>(curr<\/span>.nextNode<\/span> !=<\/span> null<\/span>)<\/span>
                               \u00a0 \u00a0 \u00a0  {<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                               \u00a0 \u00a0 \u00a0  }<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0curr<\/span>.nextNode<\/span> =<\/span> newStudent<\/span>;<\/span>
                               \u00a0  }<\/span>
                              \u200b<\/span>
                               \u00a0 \u00a0public<\/span> bool<\/span> IsEmpty<\/span>()<\/span>
                               \u00a0  {<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0return<\/span> root<\/span> ==<\/span> null<\/span>;<\/span>
                               \u00a0  }<\/span>
                               \u00a0 \u00a0<\/span>
                                  \/\/\u5f9e\u6839\u7bc0\u9ede\u958b\u59cb\u6253\u5370\u6240\u6709\u7bc0\u9ede<\/span><\/span>
                               \u00a0 \u00a0public<\/span> void<\/span> Print<\/span>()<\/span>
                               \u00a0  {<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0StudentNode<\/span> curr<\/span> =<\/span> root<\/span>;<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0while<\/span>(curr<\/span> !=<\/span> null<\/span>)<\/span>
                               \u00a0 \u00a0 \u00a0  {<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Console<\/span>.WriteLine<\/span>($<\/span>\"Name:{curr.studentName} - Score:{curr.studentScore}\"<\/span>);<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                               \u00a0 \u00a0 \u00a0  }<\/span>
                               \u00a0  }<\/span>
                              }<\/span>
                              public<\/span> class<\/span> StudentNode<\/span><\/span>
                              {<\/span>
                               \u00a0 \u00a0public<\/span> StudentNode<\/span> nextNode<\/span>; \/\/\u4e0b\u4e00\u500b\u7bc0\u9ede\u7684\u5f15\u7528<\/span><\/span>
                               \u00a0 \u00a0public<\/span> string<\/span> studentName<\/span>;<\/span>
                               \u00a0 \u00a0public<\/span> int<\/span> studentScore<\/span>;<\/span>
                              \u200b<\/span>
                               \u00a0 \u00a0public<\/span> StudentNode<\/span>(string<\/span> name<\/span>, int<\/span> score<\/span>)<\/span>
                               \u00a0  {<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0this<\/span>.studentName<\/span> =<\/span> name<\/span>;<\/span>
                               \u00a0 \u00a0 \u00a0 \u00a0this<\/span>.studentScore<\/span> =<\/span> score<\/span>;<\/span>
                               \u00a0  }<\/span>
                              }<\/span><\/pre><\/li><\/ul>
                              \u63d2\u5165<\/span><\/u><\/span><\/strong><\/span><\/h5>
                              • \u63d2\u5728\u7b2c\u4e00\u500b\u7bc0\u9ede\u524d\uff1a\u65b0\u7bc0\u9ede\u6307\u5411\u539f\u4f86\u7684\u6839\u7bc0\u9ede\uff0c\u4f7f\u7b2c\u4e00\u500b\u7bc0\u9ede\u6210\u70ba\u6839\u7bc0\u9ede<\/span><\/p><\/li>
                              • \u63d2\u5728\u6700\u5f8c\u4e00\u500b\u7bc0\u9ede\u5f8c\uff1a\u904d\u6b77\u5230\u6700\u5f8c\uff0c\u5c07\u6700\u5f8c\u7684\u7bc0\u9ede\u6307\u5411\u65b0\u7bc0\u9ede\uff0c\u65b0\u7bc0\u9ede\u6307\u5411\u7a7a<\/span><\/p><\/li><\/ul>
                                • \u63d2\u5728\u4efb\u610f\u4f4d\u7f6e\uff1a\u904d\u6b77\u7684\u540c\u6642\u5c07\u4f4d\u7f6e\u53c3\u6578\u905e\u6e1b\uff0c\u7576\u905e\u6e1b\u6578 == 1\u7684\u6642\u5019\uff0c\u4ee3\u8868\u7576\u524d\u7bc0\u9ede\u7684\u4e0b\u4e00\u500b\u7bc0\u9ede\u5c31\u662f\u6211\u5011\u65b0\u7bc0\u9ede\u7684\u4f4d\u7f6e\u3002\u5148\u8b93\u65b0\u7bc0\u9ede\u6307\u7576\u524d\u7bc0\u9ede\u539f\u4f86\u7684\u4e0b\u500b\u7bc0\u9ede\uff0c\u518d\u5c07\u7576\u524d\u7bc0\u9ede\u7684\u4e0b\u500b\u7bc0\u9ede\u6539\u70ba\u65b0\u7bc0\u9ede\u3002<\/span><\/p><\/li>
                                • public<\/span> void<\/span> Insert<\/span>(string<\/span> name<\/span>, int<\/span> score<\/span>, int<\/span> insertPos<\/span>)<\/span>
                                  {<\/span>
                                   \u00a0 \u00a0StudentNode<\/span> newStudent<\/span> =<\/span> new<\/span> StudentNode<\/span>(name<\/span>, score<\/span>);<\/span>
                                   \u00a0 \u00a0StudentNode<\/span> curr<\/span> =<\/span> root<\/span>;<\/span>
                                   \u00a0 \u00a0if<\/span>(insertPos<\/span> ==<\/span> 0<\/span>) \/\/Add at head<\/span><\/span>
                                   \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (curr<\/span> !=<\/span> null<\/span>)<\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0newStudent<\/span>.nextNode<\/span> =<\/span> curr<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0root<\/span> =<\/span> newStudent<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0return<\/span>;<\/span>
                                   \u00a0  }<\/span>
                                   \u00a0 \u00a0else<\/span><\/span>
                                   \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(insertPos<\/span> ==<\/span> -<\/span>1<\/span>) \/\/Add at tail<\/span><\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0while<\/span>(curr<\/span>.nextNode<\/span> !=<\/span> null<\/span>)<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span>.nextNode<\/span> =<\/span> newStudent<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0return<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0else<\/span> \/\/Add in specific position<\/span><\/span>
                                   \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0while<\/span> (insertPos<\/span> ><\/span> 1<\/span>) \/\/when pos == 1, mean curr.next is our target position<\/span><\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(curr<\/span>.nextNode<\/span> ==<\/span> null<\/span>) \/\/if meet tail while finding position, then just add it at tail<\/span><\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span>.nextNode<\/span> =<\/span> newStudent<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0return<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\/\/Finding target position<\/span><\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0insertPos<\/span>--<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\/\/insert newNode at middle of currNode and nextNode;<\/span><\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0newStudent<\/span>.nextNode<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span>.nextNode<\/span> =<\/span> newStudent<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0return<\/span>;<\/span>
                                   \u00a0 \u00a0 \u00a0  }<\/span>
                                   \u00a0  }<\/span>
                                  }<\/span><\/pre><\/li><\/ul>
                                  \u522a\u9664<\/span><\/u><\/strong><\/span><\/h5>
                                  • \u522a\u9664\u9996\u7bc0\u9ede\uff1a\u5c07\u6839\u7bc0\u9ede\u6539\u70ba\u539f\u4f86\u6839\u7bc0\u9ede\u7684\u4e0b\u4e00\u500b\u7bc0\u9ede<\/span><\/p><\/li>
                                  • \u522a\u9664\u4e2d\u9593\/\u5c3e\u90e8\u7bc0\u9ede\uff1a\u904d\u6b77\u7684\u540c\u6642\u5c07\u4f4d\u7f6e\u53c3\u6578\u905e\u6e1b\uff0c\u7576\u905e\u6e1b\u6578 == 1\u7684\u6642\u5019\uff0c\u4ee3\u8868\u7576\u524d\u7bc0\u9ede\u7684\u4e0b\u4e00\u500b\u7bc0\u9ede\u5c31\u662f\u6211\u5011\u8981\u522a\u9664\u7684\u7bc0\u9ede\u3002\u5148\u8b93\u7576\u524d\u7bc0\u9ede\u6307\u5411\u4e0b\u500b\u7bc0\u9ede\u7684\u4e0b\u500b\u7bc0\u9ede\uff0c\u7576\u524d\u7bc0\u9ede\u7684\u4e0b\u500b\u7bc0\u9ede\u5931\u53bb\u5165\u53e3\u5f8c\u5c31\u4e0d\u6703\u5728\u5b58\u5728\u65bclinked list\u4e2d\u3002<\/span><\/p><\/li>
                                  • public<\/span> void<\/span> Delete<\/span>(int<\/span> pos<\/span>)<\/span>
                                    {<\/span>
                                     \u00a0 \u00a0StudentNode<\/span> curr<\/span> =<\/span> root<\/span>;<\/span>
                                    \u200b<\/span>
                                     \u00a0 \u00a0if<\/span> (pos<\/span> ==<\/span> 0<\/span>) \/\/Delete Head<\/span><\/span>
                                     \u00a0  {<\/span>
                                     \u00a0 \u00a0 \u00a0 \u00a0root<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                                     \u00a0  }<\/span>
                                    \u200b<\/span>
                                     \u00a0 \u00a0while<\/span> (pos<\/span> ><\/span> 1<\/span>) \/\/finding target delete pos, if pos == 1, mean next node should be deleted<\/span><\/span>
                                     \u00a0  {<\/span>
                                     \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(curr<\/span>.nextNode<\/span>.nextNode<\/span> ==<\/span> null<\/span>) \/\/If pos > linked list lenght, delete tail<\/span><\/span>
                                     \u00a0 \u00a0 \u00a0  {<\/span>
                                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0curr<\/span>.nextNode<\/span> =<\/span> null<\/span>;<\/span>
                                     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0return<\/span>;<\/span>
                                     \u00a0 \u00a0 \u00a0  }<\/span>
                                     \u00a0 \u00a0 \u00a0 \u00a0curr<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                                     \u00a0 \u00a0 \u00a0 \u00a0pos<\/span>--<\/span>;<\/span>
                                     \u00a0  }<\/span>
                                     \u00a0 \u00a0curr<\/span>.nextNode<\/span> =<\/span> curr<\/span>.nextNode<\/span>.nextNode<\/span>; \/\/delete curr.next \u00a0 \u00a0 \u00a0 \u00a0<\/span><\/span>
                                    }<\/span><\/pre><\/li><\/ul>
                                    \u53cd\u8f49<\/span><\/u><\/strong><\/span><\/h5>
                                    • public<\/span> void<\/span> Reverse<\/span>()<\/span>
                                      {<\/span>
                                       \u00a0 \u00a0StudentNode<\/span> prev<\/span> =<\/span> null<\/span>;<\/span>
                                       \u00a0 \u00a0StudentNode<\/span> curr<\/span> =<\/span> root<\/span>;<\/span>
                                       \u00a0 \u00a0while<\/span>(curr<\/span> !=<\/span> null<\/span>)<\/span>
                                       \u00a0  {<\/span>
                                       \u00a0 \u00a0 \u00a0 \u00a0\/\/\u7531\u65bc\u8981\u5207\u958b\u7576\u524d\u7bc0\u9ede\u8207\u5176\u4e0b\u500b\u7bc0\u9ede\u4e4b\u9593\u7684\u93c8\u63a5\uff0c\u56e0\u6b64\u9700\u8981\u4fdd\u5b58\u4e0b\u500b\u7bc0\u9ede\u7684\u5f15\u7528<\/span><\/span>
                                       \u00a0 \u00a0 \u00a0 \u00a0StudentNode<\/span> originNext<\/span> =<\/span> curr<\/span>.nextNode<\/span>;<\/span>
                                       \u00a0 \u00a0 \u00a0 \u00a0\/\/\u628a\u7576\u524d\u7bc0\u9ede\u7684\u4e0b\u4e00\u500b\u7bc0\u9ede\u8a2d\u70ba\u524d\u9762\u7684\u7bc0\u9ede<\/span><\/span>
                                       \u00a0 \u00a0 \u00a0 \u00a0curr<\/span>.nextNode<\/span> =<\/span> prev<\/span>;<\/span>
                                       \u00a0 \u00a0 \u00a0 \u00a0\/\/\u628a\u524d\u4e00\u500b\u7bc0\u9ede\u548c\u7576\u524d\u7bc0\u9ede\u5f80\u5f8c\u63a8<\/span><\/span>
                                       \u00a0 \u00a0 \u00a0 \u00a0prev<\/span> =<\/span> curr<\/span>;<\/span>
                                       \u00a0 \u00a0 \u00a0 \u00a0curr<\/span> =<\/span> originNext<\/span>; \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0<\/span>
                                       \u00a0  }<\/span>
                                       \u00a0 \u00a0\/\/\u6700\u5f8cprev\u6703\u8b8a\u6210\u65b0\u7684\u6839\u7bc0\u9ede<\/span><\/span>
                                       \u00a0 \u00a0root<\/span> =<\/span> prev<\/span>;<\/span>
                                      }<\/span><\/pre><\/li><\/ul>
                                      <\/div>\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-996","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\/996","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=996"}],"version-history":[{"count":11,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/996\/revisions"}],"predecessor-version":[{"id":1008,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/996\/revisions\/1008"}],"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=996"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/categories?post=996"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/tags?post=996"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}