Re: [閒聊] 每日leetcode

[nh60211as (xXx_5354M3_31M0_xXx)]

1460. Make Two Arrays Equal by Reversing Subarrays

思路：reverse subarray any number of time 代表可以將 array 修改成任意順序
      因此只要兩個 array 內容相等即代表 canBeEqual

應該有更有效率的方式但是我懶了

class Solution {
public:
    bool canBeEqual(vector<int>& target, vector<int>& arr) {
        sort(target.begin(), target.end());
        sort(arr.begin(), arr.end());

        return target == arr;
    }
};

--
https://i.imgur.com/07Uv9NC.png  https://i.imgur.com/YNJpGoH.png
https://i.imgur.com/G69mH5A.png  https://i.imgur.com/ptaX5iW.png
https://i.imgur.com/hEeZuph.png  https://i.imgur.com/mGTKAFz.png
https://i.imgur.com/gdejDOy.png  https://i.imgur.com/JX7AHZc.png
https://i.imgur.com/X6Pgqgi.png  https://i.imgur.com/mJ8dU86.png

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 125.228.71.204 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1722692169.A.865.html
推 oin1104: 大師
推 sustainer123: 大師
推 devilkool: 我也這樣寫，就懶