【笨方法學PAT】對字串的reverse
一、reverse
string s;
reverse(s.begin(),s.end());
標頭檔案:#include<algorithm>
二、程式碼
#include<iostream> #include<string> #include<algorithm> using namespace std; int main() { string s = "Hello"; string s1 = s; reverse(s.begin(), s.end()); //Hello cout << s; //olleH cout << s1; system("pause"); return 0; }
相關推薦
【笨方法學PAT】對字串的reverse
一、reverse string s; reverse(s.begin(),s.end()); 標頭檔案:#include<algorithm> 二、程式碼 #include<iostream> #include<string> #incl
【笨方法學PAT】1013 Battle Over Cities(25 分)
一、題目 It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/towa
【笨方法學PAT】1012 The Best Rank(25 分)
一、題目 To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programmin
【笨方法學PAT】1011 World Cup Betting(20 分)
一、題目 With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams
【笨方法學PAT】1010 Radix(25 分)
一、題目 Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal numbe
【笨方法學PAT】1009 Product of Polynomials(25 分)
一、題目 This time, you are supposed to find A×B where A and B are two polynomials. Input Specification: Each input
【笨方法學PAT】1008 Elevator(20 分)
一、題目 The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at wh
【未完成】【笨方法學PAT】1018 Public Bike Management (30 分)
一、題目 There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike
【笨方法學PAT】1149 Dangerous Goods Packaging (25 分)
一、題目 When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourse
【笨方法學PAT】1150 Travelling Salesman Problem (25 分)
一、題目 The "travelling salesman problem" asks the following question: "Given a list of cities and the distances between each pair of cities, what is
【笨方法學PAT】1037 Magic Coupon (25 分)
一、題目 The magic shop in Mars is offering some magic coupons. Each coupon has an integer N printed on it, meaning that when you use this c
【笨方法學PAT】1038 Recover the Smallest Number (30 分)
一、題目 Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given { 32, 321, 3214, 0229, 8
【笨方法學PAT】1059 Prime Factors (25 分)
一、題目 Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1k
【未完成】【笨方法學PAT】1060 Are They Equal (25 分)
一、題目 If a machine can save only 3 significant digits, the float numbers 12300 and 12358.9 are considered equal since they are both saved as 0
【笨方法學PAT】1044 Shopping in Mars (25 分)
一、題目 Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). Whe
【笨方法學PAT】1051 Pop Sequence (25 分)
一、題目 Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly
【笨方法學PAT】1074 Reversing Linked List (25 分)
一、題目 Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L.
【笨方法學PAT】1140 Look-and-say Sequence (20 分)
一、題目 Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D113, D11231, D112213111, ... where D is in [0,
【笨方法學PAT】1108 Finding Average (20 分)
一、題目 The basic task is simple: given N real numbers, you are supposed to calculate their average. But what makes it complicated is that
【笨方法學PAT】1112 Stucked Keyboard (20 分)
一、題目 On a broken keyboard, some of the keys are always stucked. So when you type some sentences, the characters corresponding to those keys will a