(1) Spiral Matrix
一圈圈循环,主要难点在于下标计算:
class Solution {
public:
vector<int> spiralOrder(vector<vector<int> > &matrix) {
if(matrix.empty())
return vector<int>();
int height=matrix.size(),width=matrix[0].size();
int x=0;
vector<int> ret;
while(height>1 && width>1)
{
for(int i=0;i<width-1;i++)
ret.push_back(matrix[x][x+i]);
for(int i=0;i<height-1;i++)
ret.push_back(matrix[x+i][width-1+x]);
for(int i=0;i<width-1;i++)
ret.push_back(matrix[height-1+x][x+width-1-i]);
for(int i=0;i<height-1;i++)
ret.push_back(matrix[x+height-1-i][x]);
x++;
height-=2;
width-=2;
}
if(height==1)
for(int i=0;i<width;i++)
ret.push_back(matrix[x][x+i]);
else if(width==1)
for(int i=0;i<height;i++)
ret.push_back(matrix[x+i][x]);
return ret;
}
};
(2) Spiral Matrix II
和(1)几乎一样:
class Solution {
public:
vector<vector<int> > generateMatrix(int n) {
vector<vector<int>> ret(n);
for(int i=0;i<n;i++)
ret[i]=vector<int>(n);
int height=n,width=n,x=0,count=1;
while(height>1 && width>1)
{
for(int i=0;i<width-1;i++)
ret[x][x+i]=count++;
for(int i=0;i<height-1;i++)
ret[x+i][width-1+x]=count++;
for(int i=0;i<width-1;i++)
ret[height-1+x][x+width-1-i]=count++;
for(int i=0;i<height-1;i++)
ret[x+height-1-i][x]=count++;
x++;
height-=2;
width-=2;
}
if(height==1)
ret[x][x]=count++;
return ret;
}
};
(3) Search in Rotated Sorted Array
还是二分查找,不过得线判断断点在哪边:
class Solution {
public:
int search(int A[], int n, int target) {
int begin=0,end=n-1,mid;
while(begin<=end)
{
mid=(begin+end)/2;
if(A[mid]==target)
return mid;
if(A[begin]<=A[mid]) //断点在mid右边
{
if(A[mid]>target && A[begin]<=target)
end=mid-1;
else
begin=mid+1;
}
else //断点在mid左边
{
if(target>A[mid] && target<=A[end])
begin=mid+1;
else
end=mid-1;
}
}
return -1;
}
};
(4) Search in Rotated Sorted Array II
比(3)复杂一点,在于如果begin,mid,end三个点如果都一样的话就无法判断断点在哪边,所以解决方法也很简单,如果是这种情况那就缩短begin,end范围,过滤掉重复值[1]:
class Solution {
public:
bool search(int A[], int n, int target) {
int begin=0,end=n-1,mid;
while(begin<=end)
{
mid=(begin+end)/2;
if(A[mid]==target)
return true;
if(A[begin]==A[mid] && A[mid]==A[end])
{
begin++;
end--;
}
else if(A[begin]<=A[mid]) //断点在mid右边
{
if(A[mid]>target && A[begin]<=target)
end=mid-1;
else
begin=mid+1;
}
else //断点在mid左边
{
if(target>A[mid] && target<=A[end])
begin=mid+1;
else
end=mid-1;
}
}
return false;
}
};
参考:
[1] http://www.2cto.com/kf/201401/271561.html