js模拟分页算法

// j为序号从1开始
outputClassItem : function(j, room, ratePlans) {
		var html = new Array();
		var pageClass = "";
		console.log(j);
		for(var i = 1;i <= 10;i++){
    		var num = (i - 1) * 4 + 1;
			if(num == j){
				pageClass = " page"+i+":"+j+":"+num;
				break;
			}
		}
		if (room != null) {
			html.push('<li class="room_list_container'+pageClass+'">');

 

js模拟分页算法

 

/**
	 * 输出表格一行
	 */
	outputClassItem : function(j, room, ratePlans) {
		var html = new Array();
		var pageClass = "";
		for(var i = 1;i <= 10;i++){
    		var beginNum = (i - 1) * 4 + 1;
    		var endNum = i * 4;
			if(j >= beginNum && j <= endNum ){
				pageClass = " page"+i;
				break;
			}
		}
		if (room != null) {
			html.push('<li class="room_list_container'+pageClass+'">');

 js模拟分页算法