
C++
C++(c plus plus)是一种计算机高级程序设计语言,由C语言扩展升级而产生 ,最早于1979年由本贾尼·斯特劳斯特卢普在AT&T贝尔工作室研发。
Qiqy
喜欢村上春树的一句话:“有限的目标,能让人生变的简洁”
展开
-
Android-MTK平台功能需求解决:客户电池NTC功能(高低温报警功能)--第1天分析与解决
本文是对于该BUG的第一天分析解决内容。作为Android开发初学者分享一下解决BUG实现相关内容的完整且详细的解决步骤,首先搞清楚问题是什么,目的要干嘛?然后需要做什么准备,有一个大致的定位思路,其次遇到问题思考问题,注意逻辑性、连贯性,再者保持记录与分析,最后得出结果后倒推实现逻辑与复盘,最最后修改代码、检查代码、编译、打包、测试。原创 2023-06-07 16:10:51 · 1703 阅读 · 1 评论 -
【C++编程基础】AOJ (C++ Programming II)—1-A-vector
1-A-vector题目VectorFor a dynamic arrayA={a0,a1,…}A ={a0,a1,…} of integers, perform a sequence of the following operations:0 pushBack(x): add element x at the end of A randomAccess§:1 p print element a[p]2 popBack(): delete the last element of A A原创 2020-08-03 11:02:48 · 782 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—3-A-min-max
3-A-min-max题目For given three integers a,b,c, print the minimum value and the maximum value.输入The input is given in the following format. a b c Three integers a,b,c are given in a line.输出Print the minimum and maximum values separated by a space in a l原创 2020-08-08 15:52:33 · 238 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—3-D-lexicograhical comparison
3-D-lexicograhical comparison题目Lexicographical Comparison Compare given two sequence A={a0,a1,…,an−1} and B={b0,b1,…,bm−1 lexicographically.输入The input is given in the following format. n a0 a1,…,an−1 m b0 b1,…,bm−1 The number of elements in A and its原创 2020-08-08 16:19:49 · 204 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—2-B-queue
2-B-queue题目queueQueue is a container of elements that are inserted and deleted according to FIFO (First In First Out). For n queues Qi (i=0,1,…,n−1), perform a sequence of the following operations.enqueue(t, x): Insert an integer x to Qt.front(t): Re原创 2020-08-07 09:42:33 · 655 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—4-A-reverse
3-D-lexicograhical comparison题目Reverse Write a program which reads a sequence of integers A={a0,a1,…,an−1} and reverse specified elements by a list of the following operation: reverse(b,e): reverse the order of ab,ab+1,…,ae−1输入The input is given in the原创 2020-08-08 16:28:39 · 429 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—3-B-min-max element
3-B-min-max element题目Write a program which manipulates a sequence A={a0,a1,…,an−1} by the following operations: min(b,e): report the minimum element in ab,ab+1,…,ae−1 max(b,e): report the maximum element in ab,ab+1,…,ae−1输入The input is given in the fol原创 2020-08-08 16:04:02 · 223 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—2-A-stack
2-A-stack题目stackStack is a container of elements that are inserted and deleted according to LIFO (Last In First Out).For n stack Si (i=0,1,…,n−1), perform a sequence of the following operations.push(t, x): Insert an integer x to St.top(t): Report the原创 2020-08-07 09:31:15 · 970 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—2-D-splice
2-D-splice题目spliceFor n lists Li (i=0,1,…,n−1), perform a sequence of the following operations.insert(t, x): Insert an integer x at the end of Lt.dump(t): Print all elements in Lt.splice(t): Transfer elements of Ls to the end of Lt. Ls becomes empty.原创 2020-08-08 15:45:02 · 488 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—2-C-priority queue
2-C-queue题目priority queuePriority queue is a container of elements which the element with the highest priority should be extracted first. For n priority queues Qi (i=0,1,…,n−1) of integers, perform a sequence of the following operations.insert(t, x):原创 2020-08-07 09:56:18 · 540 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—1-B-deque
1-A-deque题目dequeFor a dynamic array A={a0,a1,…} of integers, perform a sequence of the following operations:0 push(d, x): Add element x at the begining of A, if d=0. Add element x at the end of A, if d=1.1 randomAccess§: Print element ap.2 pop(d): D原创 2020-08-04 10:10:14 · 717 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—3-C-count
3-C-count题目Count For a given sequence of integers A={a0,a1,…,an−1}, perform the following operations. count(b,e,k): print the number of the specific values k in ab,ab+1,…,ae−1输入The input is given in the following format. n a0 a1,…,an−1 q b1 e1 k1 b2 e2原创 2020-08-08 16:12:28 · 281 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—1-D-vector II
1-D-vector II题目For n dynamic arrays Ai (i=0,1,…,n−1), perform a sequence of the following operations:pushBack(t, x): Add element x at the end of At.dump(t): Print all elements in At.clear(t): Clear At. If At is empty, do nothing.Ai is a 0-ori原创 2020-08-04 10:48:42 · 621 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—1-C-list
1-C-list题目listFor a dynamic list L of integers, perform a sequence of the following operations.L has a special element called END at the end of the list and an element of L is indicated by a cursor.insert(x): Insert x before the element indicated by原创 2020-08-04 10:31:49 · 496 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—4-C-swap
4-C-swap题目Swap Write a program which reads a sequence of integers A={a0,a1,…,an−1} and swap specified elements by a list of the following operation: swapRange(b,e,t): For each integer k (0≤k<(e−b), swap element (b+k) and element (t+k).输入The input is原创 2020-08-12 16:53:55 · 578 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—4-B-rotate
4-B-rotate题目Write a program which reads a sequence of integers A={a0,a1,…,an−1} and rotate specified elements by a list of the following operation: rotate(b,m,e): For each integer k (0≤k<(e−b)), move element b+k to the place of element b+((k+(e−m))mod原创 2020-08-12 16:47:05 · 464 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—4-D-unique
4-D-unique题目Unique For a sequence of integers A={a0,a1,…,an−1} which is sorted by ascending order, eliminate all equivalent elements.输入A sequence is given in the following format.na0 a1…,an−1输出Print the sequence after eliminating equivalent element原创 2020-08-12 17:01:53 · 407 阅读 · 0 评论 -
【C++编程基础】AOJ (C++ Programming II)—5-A-sorting pairs
5-A-sorting pairs题目Sorting Pairs Write a program which print coordinates (xi,yi) of given n points on the plane by the following criteria. first by x-coordinate in case of a tie, by y-coordinate输入A sequence is given in the following format.nx0 y0x1原创 2020-08-12 17:27:47 · 298 阅读 · 0 评论