Merge pull request #10 from pockemon/master

MinStepsinInfiniteGrid

Author: Pranjal

Arrays/MinStepsInInfiniteGrid.cpp

@@ -1,6 +1,9 @@
 // https://www.interviewbit.com/problems/min-steps-in-infinite-grid/
 // Input : X and Y co-ordinates of the points in order.
 // Each point is represented by (X[i], Y[i])
+
+// Explanatory code
+/*
 int Solution::coverPoints(vector<int> &X, vector<int> &Y) {
 
     int steps = 0, dx, dy, i = 0;
@@ -38,3 +41,19 @@ int Solution::coverPoints(vector<int> &X, vector<int> &Y) {
 
     return steps;
 }
+*/
+
+// Concise code
+int coverPoints(vector<int> &X, vector<int> &Y) {
+
+    int size1=X.size(),size2=Y.size(),ans=0;
+
+    for(int i=1;i<size1;i++)
+
+    {
+     ans = ans + (abs(X[i]-X[i-1])<abs(Y[i]-Y[i-1])?abs(Y[i]-Y[i-1]):abs(X[i]-X[i-1]));
+    }
+
+    return ans;
+} 
+