搜索结果
查询Tags标签： 1147，共有 3条记录-
1147 Heaps (30 分)--PAT甲级(判断堆)，写完这题心态有点小崩
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min he…
2021/9/7 23:37:52 人评论 次浏览 -
1147 Heaps (30 分)--PAT甲级(判断堆)，写完这题心态有点小崩
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min he…
2021/9/7 23:37:52 人评论 次浏览 -
[LeetCode] 1147. Longest Chunked Palindrome Decomposition 段式回文
You are given a string text. You should split it to k substrings (subtext1, subtext2, ..., subtextk) such that:subtexti is a non-empty string. The concatenation of all the substrings is equal to text (i.e., subtext1 + subtext2 + ... + subtextk == text…
2021/7/4 6:21:10 人评论 次浏览
