874. 模拟行走机器人

2020-02-09

1.题目描述

根据一定的规则，模拟机器人行走。

2.解答

直接进行模拟即可。

3.代码

超时代码

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

class Solution {
public:
    int robotSim(vector<int>& commands, vector<vector<int> >& obstacles) {
        int l1=commands.size();
        int w[4][2]={0,1,-1,0,0,-1,1,0};
        int x=0,y=0,t=0,res=0;
        bool f=false;
		for (int i=0;i<l1;i++){
			if (commands[i]==-2) t+=1;
			else if (commands[i]==-1) t-=1;
			else{
				f=false;
				t=abs(t+40000)%4;
				for (int j=0;j<commands[i];j++){
					x=x+w[t][0];
					y=y+w[t][1];
					vector<int>vec;
					vec.push_back(x);
					vec.push_back(y);
					vector<vector<int> >::iterator v;
					v=find(obstacles.begin(),obstacles.end(),vec);
					if (v!=obstacles.end()){
						x=x-w[t][0];
					    y=y-w[t][1];
					    f=true;
					}
					res=max(res,x*x+y*y);
					if (f) break;
				}
			}
		}
		return res;
    }
};

int main(){
	int a[5]={4,-1,-1,-2,4};
	int b[2]={2,4};
	vector<int>v1(a,a+5);
	vector<int>v2(b,b+2);
	vector<vector<int> >v3;
	v3.push_back(v2);
	Solution s;
	cout<<s.robotSim(v1,v3)<<endl;
	return 0;
} 

附上仍然超时的代码

class Solution {
public:
    int robotSim(vector<int>& commands, vector<vector<int> >& obstacles) {
        int l1=commands.size(),l2=obstacles.size();
        int w[4][2]={0,1,1,0,0,-1,-1,0};
        int x=0,y=0,t=0,res=0;
		for (int i=0;i<l1;i++){
			if (commands[i]==-2) t=(t+3)%4;
			else if (commands[i]==-1) t=(t+1)%4;
			else{
				set< pair<int,int> >myset;
				for (int j=0;j<l2;j++){
					myset.insert(make_pair(obstacles[j][0],obstacles[j][1]));
				}
				for (int j=0;j<commands[i];j++){
					int xx=x+w[t][0];
					int yy=y+w[t][1];
					if (myset.find(make_pair(xx,yy))==myset.end()){
						x=xx;y=yy;
					    res=max(res,x*x+y*y);	
					}else{
						break;
					}
				}
			}
		}
		return res;
    }
};