Catalog

Preface

subject

Conclusion

---

Preface

Today, I'd like to share with you some questions of niuke.com

subject

1 Delete the specified number from the sequence

Original idea ： Is to find the number to replace in the sequence first , Delete this number , But I soon found myself unable to delete this number .（ Some friends who know how to delete can tell me oh ！）.

Their thinking ：1 Exclude the number of deletions from the sequence .

                  2 Before moving the number after this sequence forward .

                  3 Print this new sequence .

Code ：

#include<stdio.h>

int main()
{
    int n = 0;
    scanf("%d",&n);
    int arr[50]={0};
    int i = 0;
    for(i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
    }
    // Enter the number of deletions 
    int del = 0;
    scanf("%d",&del);
    int j = 0;
    for(i=0;i<n;i++)
    {
        if(arr[i]!=del)
        {
            arr[j++]=arr[i];
        }
    }
    // Print 
    for(i=0;i<j;i++)
    {
        printf("%d ",arr[i]);
    }
    return 0;
}

 2 Integer de duplication in sequence

        

  Their thinking ：1 Find the same elements

                   2 If the number of elements is the same , Move the subsequent elements forward

Code ：

#include<stdio.h>

int main()
{
    int n = 0;
    scanf("%d", &n);
    // data input 
    int arr[1000] = { 0 };
    int i = 0;
    for (i = 0;i < n;i++)
    {
        scanf("%d", &arr[i]);
    }
    for (i = 0;i < n;i++)
    {
        int j = 0;
        for (j = i + 1;j < n;j++)
        {
            // Find the same element first 
            // If the same , Move the subsequent elements previously 
            if (arr[i] == arr[j])
            {
                int m = 0;
                for (m = j;m < n - 1;m++)
                {
                    arr[m] = arr[m + 1];
                }
                n--;// Indicates that an identical number has been removed 
                j--;// Continue to judge whether the next one is multiplicative 

            }
        }
    }
    for (i = 0;i < n;i++)
    {
        printf("%d ", arr[i]);
    }

    return 0;
}

3 Ordered sequence merging

Their thinking ：1 Create three arrays arr1 and arr2 And arr3 Let the subscripts be i and j And k( The initial values are 0).

                  2 Give Way arr1[i] and arr2[j] Compare , Let a smaller number be deposited in arr3 Zhongzai Jean i++ perhaps j++, Then continue to compare .

                  3 When arr1 perhaps arr2 After all the elements in are saved, continue to store the unfinished array in arr3 in .

Code ：

#include<stdio.h>

int main()
{
    int n = 0;
    int m = 0;
    scanf("%d %d", &n, &m);
    int arr1[1000] = { 0 };
    int arr2[1000] = { 0 };
    int arr3[2000] = { 0 };
    // data input 
    int i = 0;
    for (i = 0;i < n;i++)
    {
        scanf("%d", &arr1[i]);
    }
    for (i = 0;i < m;i++)
    {
        scanf("%d", &arr2[i]);
    }
    // Handle 
    int j = 0;
    int k = 0;
    i = 0;
    while (i < n && j < m)
    {
        // Put a smaller number into the merged array 
        if (arr1[i] < arr2[j])
        {
            arr3[k++] = arr1[i++];
        }
        else
        {
            arr3[k++] = arr2[j++];
        }
    }
    // When arr1 The array elements are saved first 
    // take arr2 Put the remaining number in arr3 in 
    if (i == n)
    {
        for (;j < m;j++)
        {
            arr3[k++] = arr2[j];
        }
    }
    else
    {
        for (;i < n;i++)
        {
            arr3[k++] = arr1[i];
        }
    }
    // Print arr3
    for (i = 0;i < k;i++)
    {
        printf("%d ", arr3[i]);
    }
    return 0;
}

Conclusion

I'll share it with you today , I hope my friends can give me more advice , Come on, everybody , Progress together ！