#include<iostream>
using namespace std;
void leftt(int a[ ],int m){
int temp = a[ 0 ];
for( int i = 1 ; i < m ; i++ )
a[ i - 1 ] = a[ i ];
a[ m - 1 ] = temp;
for( i = 0 ; i < m ; i++ )
cout<<a[ i ]<<" ";
cout<<endl;
}
int main(){
int n,a[ 100 ];
cin>>n;
for( int i = 0 ; i < n ; i++ )
cin>>a[ i ];
int b;
cin>>b;
for(int j = 0 ; j < b ; j++ )
leftt( a , n );
return 0;
}
每次将数组中的序列循环左移一个位置,该算法的时间复杂度为O(b * m),临时辅助单元为temp,则空间复杂度为O(1)
#include<iostream>
using namespace std;
int main(){
int n,a[ 100 ];
cin>>n;
int i;
for( i = 0 ; i < n ; i++ )
cin>>a[ i ];
int c , *b;
cin>>c;
b = (int *)malloc(c);
for( i = 0 ; i < c ; i++ )
b[ i ] = a[ i ];
for( i = c ; i < n ; i++ )
a[ i - c ] = a[ i ];
for( i = 0 ; i < c ; i++ )
a[ n - c + i ] = b[ i ];
for( i = 0 ; i < n ; i++ )
cout<<a[ i ]<<" ";
cout<<endl;
return 0;
}
#include<iostream>
using namespace std;
int main(){
int n,a[ 100 ];
cin>>n;
int i;
for( i = 0 ; i < n ; i++ )
cin>>a[ i ];
int c ;
cin>>c;
int *b = new int[ c ];
for( i = 0 ; i < c ; i++ )
b[ i ] = a[ i ];
for( i = c ; i < n ; i++ )
a[ i - c ] = a[ i ];
for( i = 0 ; i < c ; i++ )
a[ n - c + i ] = b[ i ];
for( i = 0 ; i < n ; i++ )
cout<<a[ i ]<<" ";
cout<<endl;
return 0;
}
new一个空间 与malloc 分配动态空间
算法空间复杂度为O( c) 时间复杂度为O(p)+O(n-p)+O(p) = O(n)