- 博客(20)
- 收藏
- 关注
RSS订阅原创 PAT(Advanced Level) Sum of Number Segments
PTA(Advanced Level) Sum of Number Segments
2023-01-03 19:25:30
83
原创 PAT(Advanced Level) 1103 Integer Factorization
PAT(Advanced Level) 1103 Integer Factorization
2023-01-03 17:22:43
115
原创 PAT(Advanced Level) 1102 Invert a Binary Tree
PTA(Advanced Level) 1102 Invert a Binary Tree
2023-01-02 16:01:53
110
原创 PAT(Advanced Level) 1015 Reversible Primes
PTA(Advanced Level) 1015 Reversible Primes
2023-01-01 16:01:19
106
原创 PAT(Advanced Level) 1013 Battle Over Cities
PTA(Advanced Level) 1013 Battle Over Cities
2023-01-01 13:28:19
79
转载 PAT(Advanced Level) 1012 The Best Rank
PTA(Advanced Level) 1012 The Best Rank
2023-01-01 11:15:15
120
原创 PAT(Advanced Level) 1011 World Cup Betting
PTA(Advance Level) 1011 World Cup Betting
2022-12-31 18:52:43
126
原创 PAT(Advanced Level) 1009 Product of Polynomials
PTA(Advanced Level) 1009 Product of Polynomials
2022-12-31 14:47:33
136
原创 PAT(Advanced Level) 1007 Maximum Subsequence Sum
PTA(Advanced Level) 1007 Maximum Subsequence Sum
2022-12-31 13:21:44
123
原创 PAT(Advanced Level) 1006 Sign In and Sign Out
PAT(Advanced Level) 1006 Sign In and Sign Out
2022-12-29 19:37:48
111
原创 PAT(Advanced Level) 1005 Spell It Right
PAT(Advanced Level) 1005 Spell It Right
2022-12-29 17:58:38
86
原创 PAT(Advanced Level) 1004 Counting Leaves
PTA(Advance Level) 1004 Counting Leaves
2022-12-29 15:04:26
83
原创 PAT (Advanced Level) 1002 A+B for Polynomials
PAT(Advanced Level) 1002 A+B for Polynomials
2022-12-28 16:35:48
87
原创 PAT (Advanced Level) 1147 Heaps
无需创建树，直接使用数组即可。#include<iostream>#include<vector>#include<algorithm>using namespace std;int m, n;bool maxheap;bool minheap;vector<int> level;void isHeap(int index) { if (index * 2 > n) return; if ((index * 2 + 1) <
2022-03-06 15:38:23
154
原创 Leetcode.1.两数之和
Leetcode.1.两数之和小白第一次的代码用了两个for循环，时间复杂度O(n^2)class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: a=len(nums) for n in range(0,a): for m in ra...
2020-04-16 21:13:43
128
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人