zoukankan      html  css  js  c++  java
  • php 连续留存与留存人数计算

    for($i = 0;$i <= $interval;$i++) {
    		        $res  = $model->turnround($today,$tomorrow,$flag); 
    		        $temp = array(); 
    		        foreach($res as $value){
    		        	$inmatch = isset($value['inmatch']) ? json_decode($value['inmatch']) : array();
    		            foreach($inmatch as $val) {
    		            	if(!in_array($val, $temp)) {
    	                        array_unshift($temp,$val);  
    		            	}
    		            }
    		        }
    		        $i==0 ? $total = count($temp) : "";     
    		        $temp = array_fill_keys($temp, $i); 
    		        foreach($temp as $k=>$v) {
    		        	if(array_key_exists($k,$stats)) { 
    	                    $stats[$k] = $stats[$k].",".$v;
    		        	} else {
    		        		$stats[$k] = $v;
    		        	}
    		        }
    		        $today    = $today + 86400; 
    	            $tomorrow = $tomorrow + 86400;        
    		    }
    			$strlen = ($interval+1)*2-1;
    			foreach($stats as $v) {
    				if(isset($v)) {
    					strlen(trim($v)) == $strlen ? $num++ : $num;
    				}		
    			}
    			$ret['turnround']['all']   = $stats;
    			$ret['turnround']['total'] = $total;
    			$ret['turnround']['stats'] = count($stats);
    			$ret['turnround']['num']   = $num; 
    			*/
    			$res = $model->turnround($today,$tomorrow,$flag); 
                $todayPeople = array(); 
    	        foreach($res as $value){
    	        	$inmatch = isset($value['inmatch']) ? json_decode($value['inmatch']) : array();
    	            foreach($inmatch as $val) {
    	            	if(!in_array($val, $todayPeople)) {
                            array_unshift($todayPeople,$val);  
    	            	}
    	            }
    	        }
    	        $todayNum   = count($todayPeople);  
    	        $atToday    = $today + $interval*86400;
    	        $atTomorrow = $tomorrow + $interval*86400; 
    	        $atRes = $model->turnround($atToday,$atTomorrow,$flag); 
    	        $atPeople = array(); 
    	        foreach($atRes as $v){
    	        	$atInmatch = isset($v['inmatch']) ? json_decode($v['inmatch']) : array();
    	            foreach($atInmatch as $val) {
    	            	if(!in_array($val, $atPeople)) {
                            array_unshift($atPeople,$val);  
    	            	}
    	            }
    	        }
    	        $same = array_intersect($todayPeople,$atPeople);
    	        $atNum= count($same);
    	        $ret['turnround']['all']   = $todayPeople;   
    			$ret['turnround']['total'] = $todayNum;      
    			$ret['turnround']['stats'] = "";    
    			$ret['turnround']['num']   = $atNum;      
    
  • 相关阅读:
    ny2 括号配对问题
    ny14 会场安排问题
    杭电ACM题目分类
    hdoj2037 今年暑假不AC
    ny37 回文字符串
    算法 字符串的排列组合
    手撸IoC
    Java设计模式
    多种方法求java求整数的位数
    二叉树之 二叉树深度
  • 原文地址:https://www.cnblogs.com/Fly-Wind/p/4922550.html
Copyright © 2011-2022 走看看