HTML渲染为UWP的原生控件

没啥用的前言

说着再做UWP就剁手,我还是开了一个新坑🤣
这次是B岛UWP端
论坛客户端的一个老大难问题是内容的呈现。论坛一般以网页端为主,网页做好,论坛活跃起来后之后才会开发客户端/有开发者愿意做第三方的客户端。因此,API绝大多数情况是为网页端为一等公民的。此外,各个UI框架展示内容的格式也各有不同。以上两个原因导致HTML被选做富文本展示的通用语言。

PAT 1097 Deduplication on a Linked List

Deduplication on a Linked List

Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each value K, only the first node of which the value or absolute value of its key equals K will be kept. At the mean time, all the removed nodes must be kept in a separate list. For example, given L being 21→-15→-15→-7→15, you must output 21→-15→-7, and the removed list -15→15.

PAT

PAT 1021 Deepest Root

Deepest Root

A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root is called the deepest root.

PAT

重学「冒泡排序」

PAT里链表题有各式各样的骚操作。这些非常规操作易学易用,但是习惯了这些后,反而对题目真正想考察的知识生疏了。今天就碰到一道这样的题,想用正经的算法写却写不出来。希望大家以我为戒,不要过多的学习这些「奇技淫巧」

PAT

PAT-1038 Recover the Smallest Number

Recover the Smallest Number

Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given { 32, 321, 3214, 0229, 87 }, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different orders of combinations of these segments, and the smallest number is 0229-321-3214-32-87.

PAT

PAT 1007 Maximum Subsequence Sum

Maximum Subsequence Sum

Given a sequence of K integers { N​1​​, N​2​​, …, N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, …, N​j​​ } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

PAT