zoukankan      html  css  js  c++  java
  • ListComparer

        using System;
        using System.Collections;
        using System.Runtime.CompilerServices;

        public static class ListComparer
        {
            public static bool ListsEqual(IList list1, IList list2)
            {
                if (list1.Count != list2.Count)
                {
                    return false;
                }
                for (int i = 0; i < list1.Count; i++)
                {
                    if (list1[i] != list2[i])
                    {
                        return false;
                    }
                }
                return true;
            }

            public static bool ListsEqual(IList list1, IList list2, ObjectCompareDelegate compare)
            {
                if (list1.Count != list2.Count)
                {
                    return false;
                }
                for (int i = 0; i < list1.Count; i++)
                {
                    if (!compare(list1[i], list2[i]))
                    {
                        return false;
                    }
                }
                return true;
            }

            public delegate bool ObjectCompareDelegate(object x, object y);
        }

  • 相关阅读:
    LeetCode#34 Search for a Range
    Multiplication algorithm
    LeetCode#31 Next Permutation
    Spring boot之Hello World
    spring boot 简介
    分布式-网络通信-线程
    分布式-网络通信-协议
    分布式-架构图
    9.leetcode70-climbing stairs
    8.Leetcode69 Sqrt(x) 笔记
  • 原文地址:https://www.cnblogs.com/bigmouthz/p/1668637.html
Copyright © 2011-2022 走看看