xvrixingkong的博客

软考高级+系统架构设计师教程+第二版新版+电子版pdf

xvrixingkong — Sun, 24 Sep 2023 18:56:06 +0800

上篇为综合知识，介绍了系统架构设计师应熟练掌握的基本知识，主要包括绪论、计算机系统、信息系统、信息安全技术、软件工程、数据库设计、系统架构设计、系统质量属性与架构评估、软件可靠性、软件架构的演化和维护、未来信息综合技术等诸多基本知识和方法。下篇为案例分析，分门别类地详细介绍了系统架构设计的相关理论、方法和案例分析，主要包括信息系统架构、层次式架构、云原生架构、面向服务架构、嵌入式系统架构、通信系统架构、安全架构和大数据架构等诸多设计理论和案例。第16章嵌入式系统架构设计理论与实践。

【Ubuntu git clone命令报错】fatal: unable to access ‘https://github.com/XXX‘: gnutls_handshake() failed:

xvrixingkong — Fri, 17 Mar 2023 00:34:59 +0800

Ubuntu git clone 命令报错： Cloning into 'XXX'... fatal: unable to access 'https://github.com/XXX': gnutls_handshake() failed:The TLS connection was non-properly terminated.

Ubuntu中安装软件时出现报错Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend)……

xvrixingkong — Fri, 17 Mar 2023 00:10:32 +0800

Ubuntu中安装软件时出现报错Unable to acquire the dpkg frontend lock (/var/lib/dpkg/lock-frontend)……

C++中的命名空间

xvrixingkong — Tue, 07 Mar 2023 22:41:54 +0800

C++中命名空间的概念

C/C++中的“static”

xvrixingkong — Tue, 07 Mar 2023 22:13:59 +0800

static修饰全局变量、函数和局部变量时的相关含义

[LeetCode Python3] 396. Rotate Function + 暴力 + 错位相减

xvrixingkong — Tue, 27 Apr 2021 20:14:08 +0800

396. Rotate Function 暴力时间复杂度O(n*n) 按照计算规则，一步一步来 class Solution: def maxRotateFunction(self, nums: List[int]) -> int: size, res = len(nums), -float('inf') for i in range(size): tmp = 0 for j in range(size):

[LeetCode Python3]395. Longest Substring with At Least K Repeating Characters +递归

xvrixingkong — Mon, 26 Apr 2021 19:44:51 +0800

395. Longest Substring with At Least K Repeating Characters class Solution: def longestSubstring(self, s: str, k: int) -> int: if len(s) < k: return 0 for c in set(s): # 若某个字符c的个数大于0且小于k,那么包含它的子串必然不符合要求，

[LeetCode Python3] 394. Decode String + 递归

xvrixingkong — Thu, 22 Apr 2021 17:42:39 +0800

394. Decode String class Solution: def decodeString(self, s: str) -> str: table = "0123456789" size = len(s) index = 0 res = "" while index < size: if s[index] in table: # 若遇到数字即进入解码

[LeetCode Python3] 393. UTF-8 Validation +位处理

xvrixingkong — Wed, 21 Apr 2021 21:15:42 +0800

393. UTF-8 Validation symple & 128 == 0 表示symple必为 0xxx xxxx (symple & 128 == 128) and (symple & 64 == 0) 表示symple必为 10xx xxxx (symple & 192 == 192) and (symple & 32 == 0) 表示symple必为 110x xxxx (symple & 224 == 224) and (symple &

[LeetCode Pythons] 388. Longest Absolute File Path+O(n)

xvrixingkong — Mon, 12 Apr 2021 20:09:30 +0800

#388. Longest Absolute File Path 算法搬运工解题思路使用一个数组prefixSum,保存遍历过程中,已知层级的前缀字符串数。如前缀为aaa/bb/cc/ 则prefixSum = [0, 4, 7, 10], 即aaa/的长度,aaa/bb/的长度，aaa/bb/cc/的长度。在遍历每行数据时：保存当前行的层级level，也就是\t的数量。如果当前行为文件: 我们只要将当前文件名的长度，加上之前层级的字符串长度就行。如果当前行为文件夹: 如果层级比数组长度大，

[LeetCode Python3] 384. Shuffle an Array +洗牌算法

xvrixingkong — Mon, 05 Apr 2021 11:03:56 +0800

384. Shuffle an Array 暴力重排 class Solution: def __init__(self, nums: List[int]): self.nums = nums[:] self.tmp = nums[:] def reset(self) -> List[int]: """ Resets the array to its original configuration and return

[LeetCode Python3] 382. Linked List Random Node + 水塘抽样 +大数据流，等概率抽样

xvrixingkong — Mon, 05 Apr 2021 09:56:41 +0800

382. Linked List Random Node class Solution: def __init__(self, head: ListNode): self.head = head def getRandom(self) -> int: count = 0 reserve = self.head.val cur = self.head while cur: count

[LeetCode Python3]334. Increasing Triplet Subsequence + 暴力搜索 + 双指针

xvrixingkong — Sun, 07 Feb 2021 15:26:20 +0800

334. Increasing Triplet Subsequence 暴力搜索 class Solution: def increasingTriplet(self, nums: List[int]) -> bool: size = len(nums) if size < 3: return False for i in range(size-2): for j in range(i+1,

[LeetCode Python3] 318. Maximum Product of Word Lengths + 位掩码

xvrixingkong — Sun, 07 Feb 2021 14:40:50 +0800

318. Maximum Product of Word Lengths from collections import defaultdict class Solution: def maxProduct(self, words: List[str]) -> int: hashmap = defaultdict(int) bit_number = lambda ch: ord(ch) - ord('a') for word in words

332. Reconstruct Itinerary +欧拉通路

xvrixingkong — Wed, 03 Feb 2021 16:48:07 +0800

332. Reconstruct Itinerary class Solution: def findItinerary(self, tickets: List[List[str]]) -> List[str]: def dfs(curr: str): while vec[curr]: tmp = heapq.heappop(vec[curr]) dfs(tmp) s

[LeetCode Python3] 260. Single Number III +集合

xvrixingkong — Wed, 20 Jan 2021 19:34:41 +0800

260. Single Number III 集合的删除、添加、查找的时间复杂度均为O(1) Time:O(n); Space: O(3) class Solution: def singleNumber(self, nums: List[int]) -> List[int]: res = set() for num in nums: if num in res: res.remove(num)

[LeetCode Python3]274/275. H-Index I/II

xvrixingkong — Wed, 20 Jan 2021 19:24:07 +0800

275. H-Index II O(n) class Solution: def hIndex(self, citations: List[int]) -> int: res = 0 for index in range(len(citations)): if citations[len(citations)-1-index] >= index + 1: res = index + 1

[LeetCode Python3] 240. Search a 2D Matrix II +二分查找

xvrixingkong — Sat, 16 Jan 2021 16:40:39 +0800

240. Search a 2D Matrix II 二维版二分查找 class Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: m, n = len(matrix), len(matrix[0]) def helper(rlo, rhi, clo, chi): if rlo >= rhi or clo >= ch

[LeetCode Python3]222. Count Complete Tree Nodes +完全二叉树/满二叉树

xvrixingkong — Tue, 12 Jan 2021 19:47:06 +0800

222. Count Complete Tree Nodes 满二叉树、完全二叉树、平衡二叉树、最优二叉树 class Solution: def countNodes(self, root: TreeNode) -> int: def getheight(root): # 得到完全二叉树的高度 height = 0 while root: height += 1

[LeetCode Python3] 217/219/220. Contains Duplicate I/II/III

xvrixingkong — Mon, 11 Jan 2021 21:33:09 +0800

217. Contains Duplicate solution1: 统计每个元素出现的个数，当个数超过1时说明重复 class Solution: def containsDuplicate(self, nums: List[int]) -> bool: dic = collections.defaultdict(int) for num in nums: dic[num] += 1 for key, value in