1 条题解

  • 0
    @ 2023-6-11 12:22:25

    C++ :

    #include<iostream>
    using namespace std;
    int main() {
    	int a[110],n,i,c=0;
    	cin>>n;
    	for(i = 1; i <= n; i++) {
    		cin>>a[i];
    	}
    	
    	for(i = 1;i <= n;i++){
    		c++;
    		if(i == n || a[i] != a[i + 1]){
    			if(c != 1)
    			cout<<a[i]<<" "<<c<<endl;
    			c = 0;
    		}
    	}
    	return 0;
    }
    
    
    

    Java :

    
    import java.util.Scanner;
    public class Main {
        public static void main(String[] args) {
            Scanner scanner = new Scanner(System.in);
            int num1 = scanner.nextInt();
    //        int num2 = scanner.nextInt();
            int[] a = new int[num1];
            int[] b = new int[num1];
            int[] count = new int[100];
            double avg;
            int x = 1;
            long s = 0;
            for (int i = 0; i < num1; i++) {
                a[i] = scanner.nextInt();
            }
            for (int i = 0; i < num1 - 1; i++) {
                if(a[i] == a[i+1]){
                    x++;
                }else if(a[i] != a[i+1]){
                    if(x >= 2){
                        System.out.println(a[i - 1] + " " + x);
                        x = 1;
                    }x = 1;
                } if(a[i] == a[i+1] && i == num1 - 2) System.out.println(a[i - 1] + " " + x);
            }
    
        }
    
        public static boolean judge(int i,int j){
            int a,s = 0;
            while(i != 0){
                a = i % 10;
                s = s + a;
                i /= 10;
            }
            if(s == j)return true;
            else return false;
        }
    
        public static void paiXux(int[] a){
            int temp;
            for(int i = 0;i < a.length - 1;i++){
                for(int k = 0;k < a.length - i - 1;k++){
                    if(a[k] > a[k + 1]){
                        temp = a[k];
                        a[k] = a[k + 1];
                        a[k + 1] = temp;
                    }
                }
            }
        }public static void paiXu(int[] a,int length){
            int temp;
            for(int i = 0;i < length - 1;i++){
                for(int k = 0;k < length - i - 1;k++){
                    if(a[k] > a[k + 1]){
                        temp = a[k];
                        a[k] = a[k + 1];
                        a[k + 1] = temp;
                    }
                }
            }
        } public static void paiXud(int[] a){
            int temp;
            for(int i = 0;i < a.length - 1;i++){
                for(int k = 0;k < a.length - i - 1;k++){
                    if(a[k] < a[k + 1]){
                        temp = a[k];
                        a[k] = a[k + 1];
                        a[k + 1] = temp;
                    }
                }
            }
        }
    
        public static int MAX(int[] a){
            int max = a[0];
            for (int i = 0; i < a.length; i++) {
                if(max < a[i]){
                    max = a[i];
                }
            }
            return max;
        }
    
        public static int MIN(int[] a){
            int min = a[0];
            for (int i = 0; i < a.length; i++) {
                if(min > a[i]){
                   min = a[i];
                }
            }
            return min;
        }
        public static int sum(int a){
            int x,s = 0;
            while(a != 0){
                x = a % 10;
                s = s + x;
                a /= 10;
            }
            return s;
        }
        public static boolean isPrime(int a){
            if(a <= 1)return false;
            else
            for(int i = 2;i <= Math.sqrt(a);i++){
                if(a % i == 0)return false;
            }return true;
        }
    
        public static int qiuYu(int i){
            int a;
            a = i % 10;
            return a;
        }
    }
    

    Python :

    n=int(input())
    a=input().split()
    a=list(map(int,a))
    k=1
    b=a[0]
    for i in range(1,n):
        if(a[i]==b):
            k=k+1
        else:
            if(k>1):
                print(b,k)
            b=a[i]
            k=1
    if(k>1):
        print(b,k)
    
    • 1

    信息

    ID
    2756
    时间
    1000ms
    内存
    128MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者