We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Greedy
  4. Minimum Absolute Difference in an Array
  5. Discussions

Minimum Absolute Difference in an Array

  • joaonoch + 3 comments

    Here is your approach in C++:

    #include <numeric>
#include <iterator>
using namespace std;
typedef long long ll;

int main() {
    ll iNum; cin >> iNum;
    vector<ll> iVec, sortVec;
    copy_n(istream_iterator<ll>(cin), iNum, back_inserter(iVec));
    sort(begin(iVec),end(iVec));
    adjacent_difference(begin(iVec),end(iVec),
    back_inserter(sortVec));
    cout << *min_element(begin(sortVec)+1,end(sortVec));
    return 0;
}
    • NiceBuddy + 1 comment

      without sorting: using multiset;

      #include <cmath>
#include <limits>
#include <set>
#include <iostream>
#include <algorithm>
#include <iterator>
using namespace std;

#define ll long long int
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ll n, ans=numeric_limits<ll>::max();
    cin>>n;
    multiset<ll> mySet;
    for(auto i=0; i<n;++i)
    {
       ll temp=0;
       cin>>temp;
       mySet.insert(temp);
    }

    for(auto itr=mySet.begin(); itr!=mySet.end(); ++itr)
       if(itr!=mySet.begin())
       {
          ll a=*(itr--);
          ll b=*(itr++);
          ans=min(ans, abs(a-b));
       }

    cout<<ans<<endl;
    return 0;
}
      • Suraj_967 + 0 comments

        And that's because multiset insert does the sort work.

    • vshnu8007 + 0 comments
      [deleted]
    • h170020035 + 3 comments

      fuke

      • c170020010 + 0 comments
        [deleted]
      • reenachowdhary + 0 comments
        [deleted]
      • ion01 + 0 comments

        What does that word mean?