https://blog.youkuaiyun.com/ls158390zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/ls158390/article/details/132513463https://blog.youkuaiyun.com/ls158390/article/details/132513463ls158390Sat, 26 Aug 2023 17:00:47 +0800https://blog.youkuaiyun.com/ls158390/article/details/130175612https://blog.youkuaiyun.com/ls158390/article/details/130175612ls158390Sat, 15 Apr 2023 21:29:53 +0800https://blog.youkuaiyun.com/ls158390/article/details/129898232https://blog.youkuaiyun.com/ls158390/article/details/129898232ls158390Sat, 01 Apr 2023 16:02:57 +0800 长得不一样-> false。只有左左和右右镜像且左右和右左镜像的时候，我们才能说这两棵树是镜像的。左节点和右节点都为空 -> 倒底了都长得一样 ->true。输出：是：true，不是：false。]]>https://blog.youkuaiyun.com/ls158390/article/details/129332141https://blog.youkuaiyun.com/ls158390/article/details/129332141ls158390Mon, 20 Mar 2023 10:41:17 +0800https://blog.youkuaiyun.com/ls158390/article/details/129248638https://blog.youkuaiyun.com/ls158390/article/details/129248638ls158390Wed, 01 Mar 2023 19:43:06 +0800https://blog.youkuaiyun.com/ls158390/article/details/129220711https://blog.youkuaiyun.com/ls158390/article/details/129220711ls158390Sun, 26 Feb 2023 10:08:57 +0800https://blog.youkuaiyun.com/ls158390/article/details/129176113https://blog.youkuaiyun.com/ls158390/article/details/129176113ls158390Sat, 25 Feb 2023 16:32:47 +0800https://blog.youkuaiyun.com/ls158390/article/details/129131499https://blog.youkuaiyun.com/ls158390/article/details/129131499ls158390Mon, 20 Feb 2023 21:12:46 +0800https://blog.youkuaiyun.com/ls158390/article/details/129113296https://blog.youkuaiyun.com/ls158390/article/details/129113296ls158390Sun, 19 Feb 2023 19:03:10 +0800https://blog.youkuaiyun.com/ls158390/article/details/129068516https://blog.youkuaiyun.com/ls158390/article/details/129068516ls158390Fri, 17 Feb 2023 10:39:06 +0800https://blog.youkuaiyun.com/ls158390/article/details/129050198https://blog.youkuaiyun.com/ls158390/article/details/129050198ls158390Thu, 16 Feb 2023 10:19:22 +0800https://blog.youkuaiyun.com/ls158390/article/details/128997899https://blog.youkuaiyun.com/ls158390/article/details/128997899ls158390Sun, 12 Feb 2023 18:31:50 +0800https://blog.youkuaiyun.com/ls158390/article/details/128595265https://blog.youkuaiyun.com/ls158390/article/details/128595265ls158390Sat, 07 Jan 2023 21:08:09 +0800https://blog.youkuaiyun.com/ls158390/article/details/128583187https://blog.youkuaiyun.com/ls158390/article/details/128583187ls158390Sat, 07 Jan 2023 19:46:13 +0800https://blog.youkuaiyun.com/ls158390/article/details/128570243https://blog.youkuaiyun.com/ls158390/article/details/128570243ls158390Thu, 05 Jan 2023 21:10:41 +0800https://blog.youkuaiyun.com/ls158390/article/details/128554376https://blog.youkuaiyun.com/ls158390/article/details/128554376ls158390Wed, 04 Jan 2023 21:20:02 +0800https://blog.youkuaiyun.com/ls158390/article/details/128520031https://blog.youkuaiyun.com/ls158390/article/details/128520031ls158390Mon, 02 Jan 2023 13:41:15 +0800https://blog.youkuaiyun.com/ls158390/article/details/128515620https://blog.youkuaiyun.com/ls158390/article/details/128515620ls158390Sun, 01 Jan 2023 20:46:00 +0800https://blog.youkuaiyun.com/ls158390/article/details/128500571https://blog.youkuaiyun.com/ls158390/article/details/128500571ls158390Fri, 30 Dec 2022 20:57:49 +0800https://blog.youkuaiyun.com/ls158390/article/details/128492602https://blog.youkuaiyun.com/ls158390/article/details/128492602ls158390Fri, 30 Dec 2022 11:05:39 +0800=cnt1[n]，也就是cnt2中 n 所代表的字符出现次数，比cnt1中 n 所代表的字符出现次数多或相等，也就是含有。解题思路：把字符串s和t抽象为两个整型数组，对于子串t，记录每个字母出现的次数，定义变量diff，初值为t字符串中不重样的字符个数。利用双指针找到以下标right结尾，且含有t所有字符的最小长度区间[left,right].定义两个数组 cnt1与cnt2，将字母转化成数字，并以此为下标，出现次数作为值存进数组中，]]>