編程之美-數組迴圈移位

來源:互聯網
上載者:User
#include<stdio.h>void RightShift1(int *arr,int N,int K){//迴圈右移K %= N;while(K--){int t = arr[N - 1];for(int i = N - 1; i > 0;--i){arr[i] = arr[i - 1];}arr[0] = t;}}void Reverse(int *arr,int b,int e){for( ; b < e; b++,e--){int temp = arr[e];arr[e] = arr[b];arr[b] = temp;}}void RightShift2(int *arr,int N,int K){K %= N;Reverse(arr,0,N - K -1);Reverse(arr,N - K,N-1);Reverse(arr,0,N-1);}int gcd(int a,int b){if( b == 0 )return a;elsereturn gcd(b,a%b);}void RightShift3(int *arr,int N, int K){//迴圈右移int i,j;int num = gcd(K,N);for( i = 0 ;i < num;++i){int tmp = arr[i];j = i;while(1){int m = (j + N-K) % N;if(m == i)break;arr[j] = arr[m];j = m;}arr[j] = tmp;}}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.