codewars036: PaginationHelper

5 kyu Source

//https://www.codewars.com/kata/515bb423de843ea99400000a/train/java
package codewars.dec;
import java.util.Arrays;
import org.junit.Test;
import static org.junit.Assert.assertEquals;
import org.junit.runners.JUnit4;

public class PaginationHelperTest{
    private PaginationHelper<Character> helper = new PaginationHelper(Arrays.asList('a','b','c','d','e','f'),4);
    @Test
    public void testSomething(){
        assertEquals(2, helper.pageCount());
        assertEquals(6, helper.itemCount());
        assertEquals(4, helper.pageItemCount(0));
        assertEquals(2, helper.pageItemCount(1));
        assertEquals(-1, helper.pageItemCount(2));
        assertEquals(1, helper.pageIndex(5));
        assertEquals(0, helper.pageIndex(2));
        assertEquals(-1, helper.pageIndex(20));
        assertEquals(-1, helper.pageIndex(-10));               
    }
}
package codewars.dec;
import java.util.List;
public class PaginationHelper<I> {
    private List<I> collection;
    private int itemsPerPage;
    public PaginationHelper(List<I> collection, int itemsPerPage){
        this.collection = collection;
        this.itemsPerPage = itemsPerPage;
    }    
    public int itemCount(){
        return collection.size();
    }    
    public int pageCount(){
       int count = itemCount() % itemsPerPage == 0 ? itemCount() / itemsPerPage : itemCount() / itemsPerPage + 1;
        return count;
    }    
    public int pageItemCount(int pageIndex){
        if(pageIndex >= pageCount()){
            return -1;
        }            
        int count = pageIndex < pageCount() - 1 ? itemsPerPage : itemCount() - itemsPerPage * (pageCount() - 1);
        return count;
    }        
    public int pageIndex(int itemIndex){
        int pageIndex = -1;
        if(itemIndex >= itemCount() || itemIndex < 0){
            return pageIndex;
        }    
        pageIndex = itemIndex / itemsPerPage;
        return pageIndex;
    }    
}

转载于:https://my.oschina.net/u/553266/blog/813047

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值