{"id":568,"date":"2021-02-10T12:47:31","date_gmt":"2021-02-10T04:47:31","guid":{"rendered":"http:\/\/lonelinerd.com\/?p=568"},"modified":"2021-02-17T14:40:56","modified_gmt":"2021-02-17T06:40:56","slug":"leetcode-349","status":"publish","type":"post","link":"https:\/\/lonelinerd.com\/index.php\/2021\/02\/10\/leetcode-349\/","title":{"rendered":"[LeetCode\u5237\u984c\u7b46\u8a18] 349 – Intersection of Two Arrays"},"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

\u984c\u76ee\u63cf\u8ff0\uff1a<\/strong><\/span><\/h4>

Given two arrays, write a function to compute their intersection.<\/span><\/p>

Example 1:<\/span><\/strong><\/span><\/p>

Input: nums1 = [1,2,2,1], nums2 = [2,2]<\/span>\nOutput: [2]<\/span><\/pre>
Example 2:<\/span><\/strong><\/span><\/p>
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]<\/span>\nOutput: [9,4]<\/span><\/pre>
Note:<\/span><\/strong><\/span><\/p>
  • Each element in the result must be unique.<\/span><\/p><\/li>
  • The result can be in any order.<\/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
    \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
    \u4e00\u5237<\/strong><\/span>\u984c\u89e3\uff08Binary Search\uff09\uff1a<\/strong><\/span><\/h4>\n
            \u9019\u4e00\u984c\u8981\u6c42\u6211\u5011\u5728\u5169\u500b\u5df2\u77e5\u7684\u6578\u7d44\u4e4b\u4e2d\uff0c\u5c07\u5b83\u5011\u7684\u5e76\u96c6\u627e\u51fa\u4f86\uff0c\u4e26\u5c07\u5176\u8fd4\u56de\u3002\u90a3\u9ebc\u6700\u76f4\u63a5\u7684\u65b9\u6cd5\u5c31\u662f\u5c07\u5176\u4e2d\u4e00\u500b\u6578\u7d44\u7684\u5143\u7d20\u4f9d\u6b21\u4f5c\u70ba\u5728\u53e6\u4e00\u500b\u6578\u7d44\u4e2d\u9032\u884c\u67e5\u627e\u7684\u76ee\u6a19\uff0c\u5982\u679c\u6210\u529f\u627e\u5230\uff0c\u90a3\u5c31\u4ee3\u8868\u7576\u524d\u5143\u7d20\u662f\u5169\u500b\u6578\u7d44\u7684\u5171\u6709\u7684\u5143\u7d20\u4e4b\u4e00\uff0c\u7136\u5f8c\u5c07\u5b83\u52a0\u5230\u6211\u5011\u7684\u7d50\u679c\u6578\u7d44\u4e2d\uff08\u52a0\u5165\u524d\uff0c\u8003\u616e\u5230\u984c\u76ee\u9650\u5236 Each element in the result must be unique\uff0c\u56e0\u6b64\u9700\u8981\u5148\u6aa2\u67e5\u4e00\u4e0b\u6578\u7d44\u88e1\u9762\u662f\u5426\u5df2\u7d93\u6709\u4e86\u9019\u500b\u5143\u7d20\uff09\u3002<\/p>\n
            \u4f46\u662f\u5982\u679c\u76f4\u63a5\u7dda\u6027\u67e5\u627e\u7684\u8a71\uff0c\u5982\u679c\u76ee\u6a19\u5143\u7d20\u5728\u53e6\u4e00\u500b\u6578\u7d44\u7684\u5c3e\u90e8\u6642\uff0c\u6703\u5c0e\u81f4\u67e5\u627e\u7684\u6548\u7387\u8f03\u4f4e(O(n))\uff0c\u56e0\u6b64\uff0c\u70ba\u4e86\u63d0\u9ad8\u67e5\u627e\u6548\u7387\uff0c\u6211\u9032\u884c\u4e86\u4e8c\u5206\u67e5\u627e\u3002\u4f46\u662f\u5177\u9ad4\u8981\u5c0d\u54ea\u500b\u6578\u7d44\u9032\u884c\u4e8c\u5206\u67e5\u627e\u548c\u828d\u54ea\u500b\u6578\u7d44\u9032\u884c\u904d\u6b77\u5462\uff1f\u7531\u65bc\u9577\u5ea6\u8f03\u9577\u7684\u6578\u7d44\u6709\u53ef\u80fd\u5305\u542b\u4e86\u6578\u7d44\u8f03\u77ed\u7684\u6578\u7d44\u4e2d\u7684\u6240\u6709\u5143\u7d20\uff0c\u56e0\u6b64\uff0c\u4e8c\u5206\u67e5\u627e\u7684\u5c0d\u8c61\u81ea\u7136\u662f\u8f03\u9577\u7684\u6578\u7d44\uff0c\u800c\u904d\u6b77\u7684\u5c0d\u8c61\u5c31\u81ea\u7136\u662f\u8f03\u77ed\u7684\u6578\u7d44\u3002<\/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
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t
    public<\/span> class<\/span> Solution<\/span><\/span>
    {<\/span>
     \u00a0 \u00a0public<\/span> int<\/span>[] Intersection<\/span>(int<\/span>[] nums1<\/span>, int<\/span>[] nums2<\/span>)<\/span>
     \u00a0  {
    <\/span>        \/\/\u5c0d\u9577\u5ea6\u8f03\u9577\u7684\u6578\u7d44\u6392\u5e8f\uff0c\u6e96\u5099\u9032\u884c\u4e8c\u5206\u67e5\u627e
     \u00a0 \u00a0 \u00a0 \u00a0List<\/span><<\/span>int<\/span>><\/span> resList<\/span> =<\/span> new<\/span> List<\/span><<\/span>int<\/span>><\/span>();<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0bool<\/span> isNums1Longer<\/span> =<\/span> nums1<\/span>.Length<\/span> ><\/span> nums2<\/span>.Length<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(isNums1Longer<\/span>)<\/span>
     \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Array<\/span>.Sort<\/span>(nums1<\/span>);<\/span>
     \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0else<\/span><\/span>
     \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0Array<\/span>.Sort<\/span>(nums2<\/span>);<\/span>
     \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0
    <\/span>        \/\/\u904d\u6b77\u8f03\u77ed\u7684\u6578\u7d44
     \u00a0 \u00a0 \u00a0 \u00a0foreach<\/span>(int<\/span> num<\/span> in<\/span> isNums1Longer<\/span> ?<\/span> nums2<\/span> : nums1<\/span>)<\/span>
     \u00a0 \u00a0 \u00a0  {
    <\/span>            \/\/\u6aa2\u67e5\u7576\u524d\u5143\u7d20\u662f\u5426\u5df2\u5b58\u5728\u65bc\u7d50\u679c\u6578\u7d44
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(!<\/span>resList<\/span>.Contains<\/span>(num<\/span>))<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {
    <\/span>                \/\/\u628a\u7576\u524d\u5143\u7d20\u4f5c\u70ba\u4e8c\u5206\u67e5\u627e\u7684\u76ee\u6a19
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(BinarySearchValue<\/span>(isNums1Longer<\/span> ?<\/span> nums1<\/span> : nums2<\/span>, num<\/span>))<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {
    <\/span>                    \/\/\u627e\u5230\u4e86\u5c31\u4ee3\u8868\u662f\u5e76\u96c6\u5143\u7d20
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0resList<\/span>.Add<\/span>(num<\/span>);<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0return<\/span> resList<\/span>.ToArray<\/span>();<\/span>
     \u00a0  }
    <\/span>    \/\/\u6a19\u6e96\u7684\u4e8c\u5206\u67e5\u627e\u51fd\u6578
     \u00a0 \u00a0bool<\/span> BinarySearchValue<\/span>(int<\/span>[] nums<\/span>, int<\/span> val<\/span>)<\/span>
     \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0int<\/span> left<\/span> =<\/span> 0<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0int<\/span> right<\/span> =<\/span> nums<\/span>.Length<\/span> -<\/span> 1<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0int<\/span> mid<\/span> =<\/span> 0<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0while<\/span>(left<\/span> <=<\/span> right<\/span>)<\/span>
     \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0mid<\/span> =<\/span> left<\/span> +<\/span> (right<\/span> -<\/span> left<\/span>) \/<\/span> 2<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span>(val<\/span> ==<\/span> nums<\/span>[mid<\/span>])<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0return<\/span> true<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0else<\/span> if<\/span>(val<\/span> ><\/span> nums<\/span>[mid<\/span>])<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0left<\/span> =<\/span> mid<\/span> +<\/span> 1<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0else<\/span><\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0right<\/span> =<\/span> mid<\/span> -<\/span> 1<\/span>;<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0return<\/span> false<\/span>;<\/span>
     \u00a0  }<\/span>
    }<\/span><\/pre>\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
    \u4e8c\u5237<\/strong><\/span>\u984c\u89e3\uff08HashSet\uff09\uff1a<\/strong><\/span><\/h4>
    \u00a0 \u00a0 \u00a0 \u00a0 \u6211\u662f\u5728\u505aLeetCode\u4e0a\u7684HashTable\u6559\u5b78\u5361\u6642\u9047\u5230\u9019\u4e00\u984c\u7684\uff0c\u7136\u5f8c\u767c\u73fe\u81ea\u5df1\u66fe\u7d93\u7528Binary Search\u505a\u904e\u9019\u4e00\u984c\uff0c\u6c7a\u5b9a\u9019\u6b21\u5c31\u7528HashSet\u4f86\u4e8c\u5237\u4e00\u4e0b\u3002HashSet\u6709\u4e00\u500b\u597d\u8655\uff0c\u5c31\u662f\u5b83\u53ef\u4ee5\u78ba\u4fdd\u88e1\u9762\u7684\u5143\u7d20\u90fd\u662f\u552f\u4e00\u7684\uff0c\u9019\u4f7f\u5f97\u6211\u5011\u53ef\u4ee5\u4e8b\u5148\u5b8c\u6210\u984c\u76ee\u4e2dEach element in the result must be unique\u7684\u9650\u5236\u3002\u56e0\u6b64\uff0c\u5728\u9019\u984c\u88e1\uff0c\u6211\u9996\u5148\u5206\u5225\u5c07\u5169\u500b\u6578\u7d44\u7684\u5143\u7d20\u7d44\u6210\u5169\u500bHashSet\u3002\u7136\u5f8c\u6211\u518d\u9078\u64c7\u9577\u5ea6\u8f03\u77ed\u7684\u4e00\u500bHashSet\uff0c\u5c0d\u5b83\u9032\u884c\u904d\u6b77\uff0c\u7136\u5f8c\u4eff\u509a\u6559\u5b78\u5361\u88e1\u7684\u505a\u6cd5\uff0c\u76f4\u63a5\u4f7f\u7528\u9577\u5ea6\u8f03\u9577\u7684HashtSet\u4e2d\u7684Contains\u65b9\u6cd5\u6aa2\u67e5\u5143\u7d20\u662f\u5426\u5b58\u5728\u3002\u5b58\u5728\u5373\u70ba\u5e76\u96c6\u5143\u7d20\uff0c\u52a0\u5230\u6211\u5011\u7684\u7d50\u679c\u5217\u8868\u4e2d\uff0c\u6700\u5f8c\u5c07\u5217\u8868\u8fd4\u56de\u5373\u53ef\u3002<\/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
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t
    public<\/span> class<\/span> Solution<\/span> {<\/span>
     \u00a0 \u00a0public<\/span> int<\/span>[] Intersection<\/span>(int<\/span>[] nums1<\/span>, int<\/span>[] nums2<\/span>) {
    <\/span>        \/\/\u5efa\u69cb2\u500bHashSet\uff0c\u70ba\u5169\u500b\u6578\u7d44\u53bb\u91cd
     \u00a0 \u00a0 \u00a0 \u00a0HashSet<\/span><<\/span>int<\/span>><\/span> num1Hash<\/span> =<\/span> new<\/span> HashSet<\/span><<\/span>int<\/span>><\/span>(nums1<\/span>.Length<\/span>);<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> i<\/span> =<\/span> 0<\/span>; i<\/span> <<\/span> nums1<\/span>.Length<\/span>; i<\/span>++<\/span>)<\/span>
     \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0num1Hash<\/span>.Add<\/span>(nums1<\/span>[i<\/span>]);<\/span>
     \u00a0 \u00a0 \u00a0  }<\/span>
    \u200b<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0HashSet<\/span><<\/span>int<\/span>><\/span> num2Hash<\/span> =<\/span> new<\/span> HashSet<\/span><<\/span>int<\/span>><\/span>(nums2<\/span>.Length<\/span>);<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0for<\/span> (int<\/span> i<\/span> =<\/span> 0<\/span>; i<\/span> <<\/span> nums2<\/span>.Length<\/span>; i<\/span>++<\/span>)<\/span>
     \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0num2Hash<\/span>.Add<\/span>(nums2<\/span>[i<\/span>]);<\/span>
     \u00a0 \u00a0 \u00a0  }<\/span>
    \u200b
    <\/span>        \/\/\u904d\u6b77\u8f03\u77ed\u7684HashSet
     \u00a0 \u00a0 \u00a0 \u00a0bool<\/span> isNum1HashLonger<\/span> =<\/span> num1Hash<\/span>.Count<\/span>() ><\/span> num2Hash<\/span>.Count<\/span>();<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0List<\/span><<\/span>int<\/span>><\/span> res<\/span> =<\/span> new<\/span> List<\/span><<\/span>int<\/span>><\/span>();<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0foreach<\/span> (int<\/span> i<\/span> in<\/span> (isNum1HashLonger<\/span> ?<\/span> num2Hash<\/span> : num1Hash<\/span>))<\/span>
     \u00a0 \u00a0 \u00a0  {
    <\/span>            \/\/\u4f7f\u7528HashSet.Contains(var element)\u6aa2\u67e5\u5143\u7d20\u662f\u5426\u5b58\u5728\u65bc\u9577\u5ea6\u8f03\u9577\u7684HashSet\u4e2d
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (isNum1HashLonger<\/span>)<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (num1Hash<\/span>.Contains<\/span>(i<\/span>))<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0res<\/span>.Add<\/span>(i<\/span>); \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0else<\/span><\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if<\/span> (num2Hash<\/span>.Contains<\/span>(i<\/span>))<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  {<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0res<\/span>.Add<\/span>(i<\/span>);<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  }<\/span>
     \u00a0 \u00a0 \u00a0  }<\/span>
    \u200b<\/span>
     \u00a0 \u00a0 \u00a0 \u00a0return<\/span> res<\/span>.ToArray<\/span>(); \u00a0 \u00a0 \u00a0<\/span>
     \u00a0  }<\/span>
    }<\/span><\/pre>\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\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":"
    \u984c\u76ee\u63cf\u8ff0\uff1a Given two arrays, write a function to compute the …<\/p>\n
      [LeetCode\u5237\u984c\u7b46\u8a18] 349 – Intersection of Two Arrays<\/span> Read More »<\/a><\/p>\n","protected":false},"author":1,"featured_media":570,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,16],"tags":[],"class_list":["post-568","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-programming-notes","category-leetcodes"],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/lonelinerd.com\/wp-content\/uploads\/2021\/02\/FeatureCover_LeetCoding.png","_links":{"self":[{"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/568","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=568"}],"version-history":[{"count":9,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/568\/revisions"}],"predecessor-version":[{"id":580,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/posts\/568\/revisions\/580"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/media\/570"}],"wp:attachment":[{"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/media?parent=568"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/categories?post=568"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/lonelinerd.com\/index.php\/wp-json\/wp\/v2\/tags?post=568"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}