int main()
{
Solution solution;
//Test cases
{
int a[] = { 9, 9, 9, 9 };
vector<int> v;
INT_ARR_TO_VEC(v, a);
print_vector(solution.plusOne(v));
}
{
int a[] = { 9, 9, 9, 3 };
vector<int> v;
INT_ARR_TO_VEC(v, a);
print_vector(solution.plusOne(v));
}
//Error test cases from leetcode.com
return 0;
}
int main() {
Solution s;
vector<int> v = {9};
for (auto x:s.plusOne(v)) {
cout<<x;
}
}
void test_PlusOne()
{
vector<int> vecInt1{ 9,9,9,9,9 };
vector<int> vecInt2{ 8,9,9,9,9 };
Solution sol;
vector<int> result1;
result1 = sol.plusOne(vecInt1);
for (auto i : result1)
cout << i << " ";
cout << endl;
vector<int> result2;
result2 = sol.plusOne(vecInt2);
for (auto i : result2)
cout << i << " ";
cout << endl;
}
int main() {
Solution s;
const int arr[] = {9};
vector<int> v(arr, arr + sizeof(arr) / sizeof(arr[0]));
cout << s.plusOne(v) << endl;
return 0;
}
int main() {
Solution sol;
vector<int> test = {9,9,9};
vector<int> res = sol.plusOne(test);
printVec(res);
cout << endl;
}
int main() {
Solution sol;
vector<int> digits = {0};
print(sol.plusOne(digits));
// cout <<digits.size();
// print(sol.plusOne(digits));
}
int main()
{
int a[] = {9, 9, 9};
vector<int> v(a, a+sizeof(a)/sizeof(a[0]));
Solution sol;
sol.plusOne(v);
return 0;
}
int main(){
Solution sol;
vector<int> num={1,9,9,9};
sol.show(num);
num = sol.plusOne(num);
sol.show(num);
return 0;
}
int main()
{
vector<int> num;
num.push_back(1);
Solution s;
vector<int> result=s.plusOne(num);
return 0;
}
int main()
{
Solution *sl = new Solution();
vector<int> vec;
vec.push_back(9);
sl->plusOne(vec);
return 0;
}
int main() {
int arr[] = {9};
vector<int> vec(arr, arr+1);
Solution a;
vec = a.plusOne(vec);
des(vec);
return 0;
}
int main(){
vector<int> nums;
nums.push_back(3);
nums.push_back(4);
nums.push_back(2);
Solution s;
vector <int> res = s.plusOne(nums);
print(res);
}
int main () {
Solution s;
int a[]={9,9};
vector<int> v(a, a+2);
s.plusOne(v);
for (int i = 0; i < v.size(); i++)
cout << v[i];
return 0;
}
int main()
{
int test_arr[4] = {9, 9, 8, 9};
vector<int> vc( test_arr, test_arr+4 );
Solution sol;
sol.print_vec( sol.plusOne( vc ) );
return 0;
}
int main()
{
Solution sln;
int a[] = { 9,9,9};
vector<int> v(a, a +sizeof(a)/sizeof(int));
sln.plusOne(v);
system("pause");
return 0;
}
/*
//题意：一个整数按位存储于一个int数组中，排列顺序为：最高位在digits[0] ，最低位在digits[n-1]，
//例如：98，存储为：digits[0]=9; digits[1]=8;
//解题思路:从数组的最后一位开始加1，需要考虑进位，如果到digits[0]位之后仍然有进位存在,则将进位加上
class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
int a = 1;
vector<int> ans;
vector<int>::iterator it;
for(int i = digits.size() - 1;i >= 0;i--)
{
it = ans.begin();
int tmp = (a + digits[i]) % 10;
a = (a + digits[i]) / 10;
ans.insert(it, tmp);
}
if(a != 0)
{
it = ans.begin();
ans.insert(it, a);
}
return ans;
}
};
*/
int main()
{
Solution s;
vector<int> nums{9,9,9};
vector<int> plusone = s.plusOne(nums);
for(int i=0; i < plusone.size();i++)
cout<<plusone[i]<<" ";
cout<<endl;
}
int main()
{
vector<int> vec, result;
vec.push_back(0);
Solution s;
result = s.plusOne(vec);
PrintVector(result);
return 0;
}
int main() {
Solution s;
int k[7] = {9,9,9,9,9,9,9};
vector<int>v;
for (int i = 0;i < 7; i ++)
v.push_back(k[i]);
s.plusOne(v);
return 0;
}
int main(int argc, char *argv[]) {
Solution s;
int arr_i[] = {4, 8, 9, 2, 3};
vector<int> digits_i;
for (int i = 0; i < 5; i ++) {
cout << arr_i[i] << " ";
digits_i.push_back(arr_i[i]);
}
cout << endl;
vector<int> res = s.plusOne(digits_i);
for (int i = 0; i < digits_i.size(); i ++) {
cout << digits_i[i] << " ";
}
cout << endl;
res.clear();
int arr_ii[] = {1, 9, 9, 9, 9};
vector<int> digits_ii;
for (int i = 0; i < 5; i ++) {
cout << arr_ii[i] << " ";
digits_ii.push_back(arr_ii[i]);
}
cout << endl;
res = s.plusOne(digits_ii);
for (int i = 0; i < res.size(); i ++) {
cout << res[i] << " ";
}
cout << endl;
res.clear();
int arr_iii[] = {9, 9, 9, 9, 9};
vector<int> digits_iii;
for (int i = 0; i < 5; i ++) {
cout << arr_iii[i] << " ";
digits_iii.push_back(arr_iii[i]);
}
cout << endl;
res = s.plusOne(digits_iii);
for (int i = 0; i < res.size(); i ++) {
cout << res[i] << " ";
}
cout << endl;
return 1;
}
int main(int argc, char const *argv[]) {
Solution solution;
vector<int> digits = {};
vector<int> rel = solution.plusOne(digits);
for (auto itr = rel.begin(); itr != rel.end(); ++itr) {
cout << *itr;
}
cout << endl;
return 0;
}
int main(void){
Solution s;
int arr[] ={ 9,3,5,7};
vector<int> num;
for(int i =0; i< sizeof(arr)/sizeof(int); i++)
num.push_back(arr[i]);
vector<int> res = s.plusOne(num);
getchar();
return 0;
}
int main() {
Solution s;
std::vector<int> v = {0};
std::vector<int> r = s.plusOne(v);
for (int e : r) {
printf("%d ", e);
}
printf("\n");
return 0;
}
void main_66()
{
int a[] = {9};
vector<int> vi(a, a+sizeof(a)/sizeof(a[0]));
Solution so;
vector<int> rvi = so.plusOne(vi);
for(size_t i=0; i< rvi.size(); i++)
cout << rvi[i];
}
int main(){
Solution s;
vector<int> v;
int temp;
cout<<"input:"<<endl;
while(cin>>temp){
v.push_back(temp);
}
printVector(s.plusOne(v));
}
int main()
{
Solution so;
vector<int> nums = {1,0};
vector<int> sol = so.plusOne(nums);
for(unsigned int i=0; i<sol.size(); i++) {
cout << sol[i] << " ";
}
return 0;
}
int main() {
Solution sol;
vector<int> digits {9, 9, 9, 9};
vector<int> res = sol.plusOne(digits);
for (int val : res) {
printf("%d ", val);
}
printf("\n");
}
int main(int argc, char const *argv[])
{
vector<int> digits={9,9,9,9,9};
Solution so;
vector<int> result_v=so.plusOne(digits);
for(auto iter=result_v.begin();iter!=result_v.end();++iter)
cout<<*iter<<'\t';
cout<<endl;
return 0;
}
int main(int argc, const char * argv[]) {
// insert code here...
Solution so;
vector<int> digits;
digits.push_back(1);
digits.push_back(9);
vector<int> result = so.plusOne(digits);
so.dump(result);
return 0;
}
int main()
{
vector<int> test;
test.push_back(9);
test.push_back(9);
Solution obj;
vector<int> ans = obj.plusOne(test);
cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
return 0;
}
int main()
{
int A[] = { 9, 9 };
vector<int> vec(A, A + sizeof(A)/sizeof(int));
Solution s;
s.plusOne(vec);
return 0;
}
