1 #include<stdio.h>
2 #include<stdlib.h>
3
4 struct node{
5 int value;
6 struct node* next;
7 };
8 typedef struct node NODE;
9 typedef NODE* NODEPTR;
10
11 int main()
12 {
13 int i;
14 int count;
15 int N,M;
16 NODEPTR head=(NODEPTR)malloc(sizeof(NODE));
17 NODEPTR prePtr=head;
18 NODEPTR currPtr;
19 NODEPTR temp;
20
21 scanf("%d %d",&N,&M);
22 count=N;
23
24 for(i=1;i<=N;i++)
25 {
26 currPtr=(NODEPTR)malloc(sizeof(NODE));
27 currPtr->value=i;
28 prePtr->next=currPtr;
29 prePtr=currPtr;
30 }
31
32 currPtr->next=head->next;
33 currPtr=head->next;
34
35 while(count--)
36 {
37 for(i=1;i<=M-2;i++)
38 currPtr=currPtr->next;
39
40 temp=currPtr->next;
41 printf("%d is out\n",temp->value);
42 currPtr->next=temp->next;
43 currPtr=currPtr->next;
44 free(temp);
45 }
46
47
48 return 0;
49 }
50
2 #include<stdlib.h>
3
4 struct node{
5 int value;
6 struct node* next;
7 };
8 typedef struct node NODE;
9 typedef NODE* NODEPTR;
10
11 int main()
12 {
13 int i;
14 int count;
15 int N,M;
16 NODEPTR head=(NODEPTR)malloc(sizeof(NODE));
17 NODEPTR prePtr=head;
18 NODEPTR currPtr;
19 NODEPTR temp;
20
21 scanf("%d %d",&N,&M);
22 count=N;
23
24 for(i=1;i<=N;i++)
25 {
26 currPtr=(NODEPTR)malloc(sizeof(NODE));
27 currPtr->value=i;
28 prePtr->next=currPtr;
29 prePtr=currPtr;
30 }
31
32 currPtr->next=head->next;
33 currPtr=head->next;
34
35 while(count--)
36 {
37 for(i=1;i<=M-2;i++)
38 currPtr=currPtr->next;
39
40 temp=currPtr->next;
41 printf("%d is out\n",temp->value);
42 currPtr->next=temp->next;
43 currPtr=currPtr->next;
44 free(temp);
45 }
46
47
48 return 0;
49 }
50
]]>
2 #include<vector>
3 using namespace std;
4
5 int main()
6 {
7 vector<int> a;
8 a.push_back(1);
9 a.push_back(2);
10 a.push_back(3);
11 a.push_back(4);
12 a.push_back(5);
13
14 vector<int>::iterator pos=a.begin()+2;
15 vector<int>::iterator temp=pos+1;
16 cout<<"temp now is"<<*temp<<endl;
17
18 a.erase(pos);
19
20 cout<<"temp now is"<<*temp<<endl;
21
22 system("pause");
23 return 0;
24 }
浠婂ぉ鍦ㄧ敤STL鍐欑害鐟熷か闂鐨勬椂鍊欙紝鍙戠幇vector鐨勮涓烘繪槸浜х敓璇″紓鐨勭粨鏋滐紝璁╂垜鐧炬濅笉寰楀叾瑙ｃ?br>
鐪嬩笂闈唬鐮侊細
涓涓獀ector閲岄潰鏈?鍒?錛屾誨叡5涓厓绱犮傛妸涓涓凱浠ｅ櫒pos鎸囧悜絎笁涓厓绱?錛屽彟澶栦竴涓猼emp鎸囧悜絎洓涓厓绱?錛岀劧鍚庤皟鐢╡rase鎶婄涓変釜鍏冪礌鎶規帀銆?br>娉ㄦ剰錛屽湪榪欎釜鏃跺欑戶緇В寮曠敤temp鐨勬椂鍊欙紝浼氬彂鐜板畠鎸囧悜鐨勫厓绱犵濂囩殑鍙樻垚浜?銆?br>
闂灝卞鍦╡rase涓婇潰錛屽湪C++ Reference涓婇潰鍐欓亾錛?br>Because vectors keep an array format, erasing on positions other than the vector end also moves all the elements after the segment erased to their new positions, which may not be a method as efficient as erasing in other kinds of sequence containers (deque, list).
This invalidates all iterator and references to elements after position or first.
鍒犻櫎vector涓涓厓绱狅紝瀵艱嚧瀹冨悗闈㈢殑鍏冪礌鍏ㄩ儴縐誨姩鍒版柊鐨勪綅緗紝鎵浠ュ鑷磋繖涓厓绱犱箣鍚庣殑鎵鏈夎凱浠ｅ櫒閮藉け鏁堛?br>
鍦ㄤ嬌鐢ㄤ竴涓嚱鏁板墠搴旇瀵瑰畠鐨勮涓烘湁娓呮鐨勪簡瑙ｃ傝皚璁般?/p>
int a[][3]={1,2,3,4,5,6};
int (*b)[3]=a;
涓嶇敤緙栬瘧鍣紝璇磋b閲屾槸浠涔堬紵
鍏跺疄榪欑闂鍦ㄣ奀涓撳緙栫▼銆嬬殑P65涓殑紲炲櫒瑙ｇ爜鐜腑鏈夊緢璇﹀敖鐨勮В閲娿?br>鍦ㄨ繖閲岄鍏堣冨療絳夊紡宸﹁竟鐨刬nt (*b)[3]
| 1.鏈宸﹁竟鐨勬爣璇嗙鏄痓 | 琛ㄧずb鏄?.. |
| 2.b鐨勫乏杈規槸* |
琛ㄦ槑b鏄寚鍚?..鐨勬寚閽?br> |
| 3.*鐨勫乏杈規槸宸︽嫭鍙? |
宸︽嫭鍙鋒妸宸茬粡澶勭悊鐨勯儴鍒嗗０鏄庣粍鍚堝湪涓璧鳳紝鐭ラ亾閬囪鐩稿簲鐨勫彸鎷彿 |
| 4.(*b)宸﹁竟鏄柟鎷彿 |
琛ㄧず澶у皬涓?鐨勬暟緇? |
| 5.鍓╀笅鐨勭鍙峰艦鎴愬熀鏈被鍨媔nt |
琛ㄦ槑b鏄竴涓寚閽堬紝瀹冩寚鍚戜竴涓ぇ灝忎負3鐨刬nt鍨嬫暟緇勩? |
鑰屾妸a鐨勫艱祴緇檅錛岃〃鏄庢槸灝哹鎸囧悜a銆?br>
涔嬪悗sagasw緇欏嚭涓涓猟emo,鍙互鏇存竻妤氱殑浜嗚В鎸囬拡鐩稿叧鍚勭銆?br>
int main(int argc, char* argv[])
{
int a[][3]={1,2,3,4,5,6};
int (*b)[3]=a;
printf("a %p b %p \n", a, b);
++b;
printf("a1 %p a10 %p a11 %p b %p \n", a[1], &a[1][0], &a[1][1], b);
++b;
printf("a %p b %p \n", a[2], b);
return 0;
}
{
int a[][3]={1,2,3,4,5,6};
int (*b)[3]=a;
printf("a %p b %p \n", a, b);
++b;
printf("a1 %p a10 %p a11 %p b %p \n", a[1], &a[1][0], &a[1][1], b);
++b;
printf("a %p b %p \n", a[2], b);
return 0;
}
]]>
char temp[3];
char c;
temp[0]=getchar();
temp[1]=getchar();
temp[2]='\0';
cout<<temp<<endl;
char c;
temp[0]=getchar();
temp[1]=getchar();
temp[2]='\0';
cout<<temp<<endl;
]]>