blocks|key|4385135|text|假设你可以使用LINQ，这样的东西应该可以工作：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4385136|var+sortedList+=+Oblici.OrderBy(r+=>+r.Width+*+r.Height).ToList();|code-block|syntax|javascript|4385137|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Assuming you can use LINQ, something like this ought to work:

<pre><code>var sortedList = Oblici.OrderBy(r =&gt; r.Width * r.Height).ToList();
</code></pre>

blocks|key|4385153|text|如何，使用lambda表达式创建自己的比较器|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4385154|mylist.Sort((X,+Y)+=>+((X.Height+*+X.Width).CompareTo(Y.Height+*+Y.Width)));|code-block|syntax|javascript|4385155|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

how about this, using lambda expression to create your own Comparer

<pre><code>mylist.Sort((X, Y) =&gt; ((X.Height * X.Width).CompareTo(Y.Height * Y.Width)));
</code></pre>

blocks|key|4474058|text|这里是长篇大论的版本，它将帮助您获得其他两个版本。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4474059|就像这样|4474060|private+static+int+CompareByArea(Rectangle+r1,+Rectangle+r2)
{
+++int+a1+=+r1.Width+*+r1.Height;
+++int+a2+=+r2.Width+*+r2.Height;
+++if+(a1+<+a2)
+++{
++++++return+-+1;
+++}
+++else
+++{
+++++if+(a1+>+a2)+
+++++{
++++++++return+1;+
+++++}
+++}
+++return+0;
}|code-block|syntax|javascript|4474061|然后|4474062|MyList.Sort(CompareByArea)|4474063|List的比较器是一个静态(通常)函数，它以某种方式通过比较两个t返回-1,0,1+(小于、等于或大于|4474064|一个有意义的例子明显得让人恼火，不是吗？我也先读了技术术语，听起来很复杂。:(|4474065|entityMap^0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|T|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|V|8|@]|9|@]|A|$]]|$1|K|3|L|5|F|7|W|8|@]|9|@]|A|$G|H]]|$1|M|3|N|5|6|7|X|8|@]|9|@]|A|$]]|$1|O|3|P|5|6|7|Y|8|@]|9|@]|A|$]]|$1|Q|3|-4|5|6|7|Z|8|@]|9|@]|A|$]]]|R|$]]

And here's the long winded version that will help you get the other two.

Something like 

<pre><code>private static int CompareByArea(Rectangle r1, Rectangle r2)
{
 int a1 = r1.Width * r1.Height;
 int a2 = r2.Width * r2.Height;
 if (a1 &lt; a2)
 {
 return - 1;
 }
 else
 {
 if (a1 &gt; a2) 
 {
 return 1; 
 }
 }
 return 0;
}
</code></pre>

then 

<pre><code>MyList.Sort(CompareByArea)
</code></pre>

A comparer for List is a static(usually) function that return -1,0,1 (less than, equal to or greater than by convention) from comparing two Ts somehow

Irritatingly obvious with a meaningful example isn't it. I read the technobabble first as well, sounded really complicated. :(

blocks|key|2749183|text|尝试将此方法添加到您的Rectangle类：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|2749184|public+int+CompareTo(object+obj)
{
++if+(obj+==+null)+return+1;

++Rectangle+otherRectangle+=+obj+as+Rectangle;

++if+(otherRectangle+!=+null)
++++return+this.Width+*+this.Height+-+obj.Width+*+obj.Height;
++else
++++throw+new+ArgumentException("Object+is+not+a+Rectangle");
}|code-block|syntax|javascript|2749185|这应该允许您按面积比较两个矩形。|2749186|Rectangle的SortedList应该正确地对自身进行排序，即按区域排序。您需要从IComparable派生Rectangle，才能让所有内容都跟上。|2749187|entityMap^0|B|9|0|0|0|0|9|A|A|18|B|1L|9|0^^$0|@$1|2|3|4|5|6|7|Q|8|@$9|R|A|S|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|T|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|U|8|@]|D|@]|E|$]]|$1|M|3|N|5|6|7|V|8|@$9|W|A|X|B|C]|$9|Y|A|Z|B|C]|$9|10|A|11|B|C]|$9|12|A|13|B|C]]|D|@]|E|$]]|$1|O|3|-4|5|6|7|14|8|@]|D|@]|E|$]]]|P|$]]

Try adding this method to your <code>Rectangle</code> class:

<pre><code>public int CompareTo(object obj)
{
 if (obj == null) return 1;

 Rectangle otherRectangle = obj as Rectangle;

 if (otherRectangle != null)
 return this.Width * this.Height - obj.Width * obj.Height;
 else
 throw new ArgumentException("Object is not a Rectangle");
}
</code></pre>

That should allow you to compare two rectangles by area.

A <code>SortedList</code> of <code>Rectangle</code> should sort itself correctly, i.e. by area. You need to derive <code>Rectangle</code> from <code>IComparable</code> to make everything follow along.

How do I sort a rectangle list by their area? Been looking into IComparable at msdn library, but can't figure it out... I wrote this:

<pre><code>SortedL= new List&lt;Rectangle&gt;();
 int count1 = 0;
 int count3 = redovi;
 while (count1 &lt; count3)
 {
 int count2 = 0;
 while (count2 &lt; count3)
 {
 int x = Oblici[count1].Width;
 int y = Oblici[count1].Height;
 int z = Oblici[count2].Width;
 int w = Oblici[count2].Height;
 int area1 = x * y;
 int area2 = z * w;
 int a = area1.CompareTo(area2);
 if (a &lt; 0)
 {
 count1 = count2;
 if (count2 &lt; (count3 - 1))
 {
 count2++;
 }
 else break;
 }
 else if (a == 0)
 {
 if (count2 &lt; (count3 - 1))
 {
 count2++;
 }
 else break;
 }
 else if (a &gt; 0)
 {
 if (count2 &lt; count3 - 1)
 {
 count2++;
 }
 else break;
 }
 }
 SortedL.Add(Oblici[count1]);
 Oblici.RemoveAt(count1);
 count3 = (count3 - 1);}}
</code></pre>

And it works, but it's pretty ugly, and I know there is an easier way...

Sort List <Rectangle>

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

如何按面积对矩形列表进行排序？我已经在msdn库中查找了IComparable，但无法找到它...我写了以下内容：SortedL= new List<Rectangle>(); int count1 = 0; int count3 = redovi; while (count1...

问排序列表<Rectangle>
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问排序列表<Rectangle>EN