https://blog.youkuaiyun.com/supupupupupupzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/supupupupupup/article/details/139320881https://blog.youkuaiyun.com/supupupupupup/article/details/139320881supupupupupupThu, 30 May 2024 12:37:49 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/139041781https://blog.youkuaiyun.com/supupupupupup/article/details/139041781supupupupupupSun, 19 May 2024 14:05:12 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/139029624https://blog.youkuaiyun.com/supupupupupup/article/details/139029624supupupupupupSat, 18 May 2024 18:56:45 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/138953680https://blog.youkuaiyun.com/supupupupupup/article/details/138953680supupupupupupThu, 16 May 2024 11:42:32 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/138871033https://blog.youkuaiyun.com/supupupupupup/article/details/138871033supupupupupupWed, 15 May 2024 13:20:48 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/138859459https://blog.youkuaiyun.com/supupupupupup/article/details/138859459supupupupupupTue, 14 May 2024 16:47:54 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/138820685https://blog.youkuaiyun.com/supupupupupup/article/details/138820685supupupupupupMon, 13 May 2024 21:38:32 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/138726815https://blog.youkuaiyun.com/supupupupupup/article/details/138726815supupupupupupSat, 11 May 2024 19:02:51 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/138324216https://blog.youkuaiyun.com/supupupupupup/article/details/138324216supupupupupupMon, 29 Apr 2024 20:29:01 +0800Array[x]),如果没有这个判断，则对于孤立不连通的一个结点会段错误，其对于的Array[x]是NULL。]]>https://blog.youkuaiyun.com/supupupupupup/article/details/138012491https://blog.youkuaiyun.com/supupupupupup/article/details/138012491supupupupupupSat, 20 Apr 2024 21:39:09 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/137676594https://blog.youkuaiyun.com/supupupupupup/article/details/137676594supupupupupupFri, 12 Apr 2024 13:14:42 +0800val，先和a[ia]比较是否相等，再和B[ib]比较，如果二者的和大于target就ib--，B向前走，直到等于或者小于时即可跳出，若等于还要存储在a里。缺点：时间复杂度接机N^2,对于重复结点的判断没有必要专门遍历一遍a，完全可以直接和a[i-1]去比，因为按照升序序列遍历，相同的两个节点本身就连在一起。]]>https://blog.youkuaiyun.com/supupupupupup/article/details/137552862https://blog.youkuaiyun.com/supupupupupup/article/details/137552862supupupupupupTue, 09 Apr 2024 15:16:30 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/137525882https://blog.youkuaiyun.com/supupupupupup/article/details/137525882supupupupupupMon, 08 Apr 2024 22:11:27 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/137480013https://blog.youkuaiyun.com/supupupupupup/article/details/137480013supupupupupupSun, 07 Apr 2024 22:11:34 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/137479832https://blog.youkuaiyun.com/supupupupupup/article/details/137479832supupupupupupSun, 07 Apr 2024 21:57:56 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/137243761https://blog.youkuaiyun.com/supupupupupup/article/details/137243761supupupupupupMon, 01 Apr 2024 19:25:08 +0800Data中，完成当前一段的逆转，这段代码巧妙在如果最后一段不满足K个，就不会逆转，省去了判断，超级简洁，测试点一把过。]]>https://blog.youkuaiyun.com/supupupupupup/article/details/137211356https://blog.youkuaiyun.com/supupupupupup/article/details/137211356supupupupupupSun, 31 Mar 2024 22:33:13 +0800left或者T->right)countpath都不一样，再在遇到叶子结点是，动态分配一块空间char类型的stor来从count path中读出该条路径的元素。，返回所有从根节点到叶子节点的路径。给你一个二叉树的根节点。是指没有子节点的节点。]]>https://blog.youkuaiyun.com/supupupupupup/article/details/137175516https://blog.youkuaiyun.com/supupupupupup/article/details/137175516supupupupupupSat, 30 Mar 2024 15:56:52 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/137154509https://blog.youkuaiyun.com/supupupupupup/article/details/137154509supupupupupupFri, 29 Mar 2024 19:59:17 +0800https://blog.youkuaiyun.com/supupupupupup/article/details/137091156https://blog.youkuaiyun.com/supupupupupup/article/details/137091156supupupupupupWed, 27 Mar 2024 23:03:03 +0800