Lintcode運算子多載,lintcode運算子

來源:互聯網
上載者:User

Lintcode運算子多載,lintcode運算子

實現賦值運算子多載函數,確保:

  • 新的資料可準確地被複製
  • 舊的資料可準確地刪除/釋放
  • 可進行 A = B = C 賦值


class Solution {public:    char *m_pData;    Solution() {        this->m_pData = NULL;    }    Solution(char *pData) {        this->m_pData = pData;    }    // Implement an assignment operator    Solution operator=(const Solution &object) {        // write your code here        if(this != &object) {          delete []m_pData;          if(object.m_pData!=NULL) {             m_pData = new char[strlen(object.m_pData)+1];             strcpy(m_pData,object.m_pData);             }        }        return *this;    }};


聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.