Spend more time with your computer on this special holiday, HHH

Input number n , Print out from... In order 1 To the biggest n A decimal number . Such as input 3 , Then print out 1、2、3 Up to the biggest 3 digit 999 .

• Instead of printing, return a list of integers
• n As a positive integer

OJ link 【 Question no. of niuke.com ： JZ17 Print from 1 To the biggest n digit 】

Example ：
Input ：1
Return value ：[1,2,3,4,5,6,7,8,9]

int* printNumbers(int n, int* returnSize )

{

}

If there is no interface provided by the above input , We don't need to apply for space dynamically ！

First of all, be clear n The largest number of digits , It's actually 10^n - 1

1 digit ： 10^1 - 1
2 digit ： 10^2 - 1
3 digit ： 10^3 - 1
...（ call pow function ：pow（10,n)-1）

The actual code is as follows ：

#include<stdio.h>
#include<math.h>
int main()
{
    int n,i=0;
    scanf("%d",&n);
    for(i=1;i<=(pow(10,n)-1);i++)
    {
        if(i==(pow(10,n)-1)) 
        {
            printf("%d",i);
        }
        else
        	printf("%d,",i);
    }
    return 0;
}

Operation of the ：

  Because this code is relatively simple , So I won't describe it in detail here .

---

premium ： According to the interface provided by Niuke online , Implement this interface to complete the requirements of the topic

After this is clear, the dynamic application space , Just fill in the value , It should be noted that the array subscript is from 0 Start , And the value from 1 Start

int* printNumbers(int n, int* returnSize )
{
  *returnSize = pow(10, n) - 1; // Determine the maximum number 
  int *arr = (int *)malloc(sizeof(int)*(*returnSize));// Apply for space of sufficient size 
  for (int i = 0; i < *returnSize; i++)
  {
    arr[i] = i+1;// Subscript from 0 Start , And the value from 1 Start 
  }
  return arr;
}

---

1946 year 2 month 14 Japan , The world's first general-purpose computer was born at the University of Pennsylvania , Please spend more time with your computer on this special holiday , Ha ha ha ha ha ha ha ！