703. The k-th element in the data flow

703. The... In the data stream K Big element

Design a data stream to find the k Classes of large elements （class）. Note that it's the... After the order k Big element , Not the first k A different element .

Please implement KthLargest class ：

KthLargest(int k, int[] nums)  Use integers  k  And integer stream  nums  Initialize object .
int add(int val)  take  val  Insert data stream  nums  after , Returns the current data stream at  k  Big elements .

Example ：

Input ：
[“KthLargest”, “add”, “add”, “add”, “add”, “add”]
[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
Output ：
[null, 4, 5, 5, 8, 8]

explain ：
KthLargest kthLargest = new KthLargest(3, [4, 5, 8, 2]);
kthLargest.add(3); // return 4
kthLargest.add(5); // return 5
kthLargest.add(10); // return 5
kthLargest.add(9); // return 8
kthLargest.add(4); // return 8

typedef struct {
    
    struct KthLargest *next;
    int val

} KthLargest;


KthLargest* kthLargestCreate(int k, int* nums, int numsSize) {
    
    KthLargest *l=(KthLargest*)malloc(sizeof(KthLargest));
    l->val=k;
    l->next=NULL;
    int i;
    for(i=0;i<numsSize;i++){
    
          KthLargest *p=(KthLargest*)malloc(sizeof(KthLargest));
          p->val=nums[i];
         KthLargest *pre=l,*s=l->next;
        if(i==0){
    
            p->next=l->next;
            l->next=p;

        }
        else{
    
         

            while(s){
    
                if(s->val>=nums[i]){
    break;}
                pre=s;
                s=s->next;
            }
         p->next=s;
            pre->next=p;
        }
           

    }
    return l;



}

int kthLargestAdd(KthLargest* obj, int val) {
    
     KthLargest *pre=obj,*s=obj->next;
       KthLargest *p=(KthLargest*)malloc(sizeof(KthLargest));
          p->val=val;

            while(s){
    
                if(s->val>=val){
    break;}
                pre=s;
                s=s->next;
            
        }
             p->next=s;
            pre->next=p;
        int i=1;
        s=obj->next;
        while(i<=obj->val-2){
    
            s=s->next;

            i++;
        }
         KthLargest *t=s->next;
        s->next=t->next;
         s=obj->next;
         while(s){
    
             printf("%d ",s->val);
             s=s->next;
         }
         printf("|");
        return t->val;




}

void kthLargestFree(KthLargest* obj) {
    

}

/** * Your KthLargest struct will be instantiated and called as such: * KthLargest* obj = kthLargestCreate(k, nums, numsSize); * int param_1 = kthLargestAdd(obj, val); * kthLargestFree(obj); */