• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Check Array Formation Through Concatenation

    less than 1 minute read

    <-E 1640> Check Array Formation Through Concatenation

    class Solution {
    public:
        bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {
            for(auto i:pieces){
                auto it=find(arr.begin(),arr.end(),i[0]);
                if(it != arr.end()){
                    for(auto j: i){
                        if(*it != j)
                            return false;
                        it++;
                    }
                }
                else
                    return false;
            }
            return true;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: November 29, 2020

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.