上一页 1 ··· 3 4 5 6 7 8 9 下一页

[pyqt] 实现窗口嵌套

摘要: 一、背景 最近要开一门新课,数据库综合实习,需要实现一个图形化界面程序对SqlServer数据库进行操作,在安装好Sqlserver之后选择使用pyqt实现图形化界面。 初步设计在主界面中分为左边菜单栏和右边显示栏,需要在主窗口中嵌套一个窗口,即右边显示栏。并且需要动态改变右边的窗口。 在查相关博客 阅读全文
posted @ 2019-12-27 21:58 刘好念 阅读(23) 评论(0) 推荐(0) 编辑

[LeetCode]1278. Palindrome Partitioning III

摘要: 一、题意 You are given a string s containing lowercase letters and an integer k. You need to : First, change some characters of s to other lowercase Engli 阅读全文
posted @ 2019-12-02 21:34 刘好念 阅读(2) 评论(0) 推荐(0) 编辑

[PAT]1079 Total Sales of Supply Chain (25 分)(样例2、3、5、6未过原因)

摘要: 一、题意 A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to cus 阅读全文
posted @ 2019-11-27 16:26 刘好念 阅读(5) 评论(0) 推荐(0) 编辑

[PAT]1043 Is It a Binary Search Tree (25 分)

摘要: 一、题意 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only n 阅读全文
posted @ 2019-09-09 21:58 刘好念 阅读(6) 评论(0) 推荐(0) 编辑

[leetcode] 5182. Maximum Subarray Sum with One Deletion

摘要: 一、题意 Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion. In other wor 阅读全文
posted @ 2019-09-09 11:14 刘好念 阅读(2) 评论(0) 推荐(0) 编辑

[leetcode]5175. Can Make Palindrome from Substring

摘要: 一、题意 Given a string s, we make queries on substrings of s. For each query queries[i] = [left, right, k], we may rearrange the substring s[left], ..., 阅读全文
posted @ 2019-09-01 17:52 刘好念 阅读(2) 评论(0) 推荐(0) 编辑

[PAT]1064 Complete Binary Search Tree (30 分)

摘要: 一、题意 A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only n 阅读全文
posted @ 2019-09-01 09:47 刘好念 阅读(3) 评论(0) 推荐(0) 编辑

[PAT]1067 Sort with Swap(0, i) (25 分)(运行超时解决办法)

摘要: 一、题意 Given any permutation of the numbers {0, 1, 2,..., N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operatio 阅读全文
posted @ 2019-08-31 21:07 刘好念 阅读(2) 评论(0) 推荐(0) 编辑

[PAT]1126 Eulerian Path (25 分)(样例3答案错误原因)

摘要: 一、题意 In graph theory, an Eulerian path is a path in a graph which visits every edge exactly once. Similarly, an Eulerian circuit is an Eulerian path w 阅读全文
posted @ 2019-08-31 11:29 刘好念 阅读(6) 评论(0) 推荐(0) 编辑

[PAT]1101 Quick Sort (25 分)(样例2段错误原因)

摘要: 一、题意 There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Th 阅读全文
posted @ 2019-08-30 18:58 刘好念 阅读(4) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 9 下一页