fork download
  1. #include <map>
  2. #include <string>
  3. #include <iostream>
  4. #include <vector>
  5. #include <stack>
  6. using namespace std;
  7.  
  8. class Solution {
  9. public:
  10. vector<int> plusOne(vector<int>& digits)
  11. {
  12. vector<int> res;
  13. int len = digits.size() - 1;
  14. int carry = 0;
  15. int num = digits[len] + 1;
  16.  
  17. while(len >=0 || carry)
  18. {
  19. num +=carry;
  20. res.insert(res.begin(), num%10);
  21. cout<< num%10;
  22. carry = num/10;
  23. if(len <= 0)
  24. {
  25. num = 0;
  26. len--;
  27. continue;
  28. }
  29. num = digits[--len];
  30. }
  31.  
  32. return res;
  33. }
  34. };
  35.  
  36. int main()
  37. {
  38. Solution sel;
  39. vector<string> strs = {"dog","racecar","car"};
  40. vector <int> nums = {1,2,3};
  41. vector<int>tmp;
  42. cout << "In removeElement\n";
  43. // if(sel.isPalindrome(-121))
  44. // cout<< "true";
  45. //else
  46. // cout<<"false";
  47. //cout << sel.longestCommonPrefix(strs);
  48. //sel.isValid("({{{{}}}))")? cout<< "true": cout << false;
  49. tmp = sel.plusOne(nums);
  50. for (auto a:tmp)
  51. cout<<a;
  52.  
  53. }
Success #stdin #stdout 0.01s 5288KB
stdin
45
stdout
In removeElement
421124