Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. C / C++ / MFC
  4. PLEASE HELP ME CONVERT C++ TO PYTHON

PLEASE HELP ME CONVERT C++ TO PYTHON

Scheduled Pinned Locked Moved C / C++ / MFC
c++pythonhelp
2 Posts 2 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • E Offline
    E Offline
    ege yay
    wrote on last edited by
    #1

    string laceStrings(const string& s1, const string& s2)
    {
    if (s1.empty())
    return s2;
    if (s2.empty())
    return s1;

    string laced;
    laced.resize(s1.size() + s2.size());
    
    int i = 0, pos = 0;
    int size = std::min(s1.size(), s2.size());
    
    // interlace common lengths substrings
    for ( ; i < size; ++i)
    {
        laced\[pos++\] = s1\[i\];
        laced\[pos++\] = s2\[i\];
    }
    
    // append the remainder of longer string
    if (s1.size() >= s2.size())
        for ( ; i < s1.size(); ++i)
            laced\[pos++\] = s1\[i\];
    else
        for ( ; i < s2.size(); ++i)
            laced\[pos++\] = s2\[i\];
    
    return laced;
    

    }

    PLEASE CONVERT İT TO PYTHON

    A 1 Reply Last reply
    0
    • E ege yay

      string laceStrings(const string& s1, const string& s2)
      {
      if (s1.empty())
      return s2;
      if (s2.empty())
      return s1;

      string laced;
      laced.resize(s1.size() + s2.size());
      
      int i = 0, pos = 0;
      int size = std::min(s1.size(), s2.size());
      
      // interlace common lengths substrings
      for ( ; i < size; ++i)
      {
          laced\[pos++\] = s1\[i\];
          laced\[pos++\] = s2\[i\];
      }
      
      // append the remainder of longer string
      if (s1.size() >= s2.size())
          for ( ; i < s1.size(); ++i)
              laced\[pos++\] = s1\[i\];
      else
          for ( ; i < s2.size(); ++i)
              laced\[pos++\] = s2\[i\];
      
      return laced;
      

      }

      PLEASE CONVERT İT TO PYTHON

      A Offline
      A Offline
      Aescleal
      wrote on last edited by
      #2

      Write it in idiomatic C++ (using boost) and if you know any Python at all it'll click straight away.

      1 Reply Last reply
      0
      Reply
      • Reply as topic
      Log in to reply
      • Oldest to Newest
      • Newest to Oldest
      • Most Votes


      • Login

      • Don't have an account? Register

      • Login or register to search.
      • First post
        Last post
      0
      • Categories
      • Recent
      • Tags
      • Popular
      • World
      • Users
      • Groups