✅Accepted | | ✅Easy solution || ✅Short & Simple || ✅Best Method
\n# Code\n\nclass Solution {\npublic:\n    vector<int> plusOne(vector<int>& digits) {\n       int n = digits.size() - 1;\n      \n      for (int i = n; i >= 0; 
\n# Code\n```\nclass Solution {\npublic:\n    vector<int> plusOne(vector<int>& digits) {\n       int n = digits.size() - 1;\n      \n      for (int i = n; i >= 0; --i)\n      { \n        if (digits[i] == 9)\n            digits[i] = 0;\n      else\n      {  \n          digits[i] += 1;\n          return digits;\n        }\n      }\n      digits.push_back(0);\n      digits[0] = 1;\n      return digits;\n    } \n    \n};\n```\nPlease **UPVOTE** if it helps \u2764\uFE0F\uD83D\uDE0A\nThank You and Happy To Help You!!
['C++']