leetcode

Leetcode submissions
git clone git://git.laack.co/leetcode.git
Log | Files | Refs | README

divide-two-integers.dart (517B)

      1 //Given two integers return the value of the dividend/ divisor
      2 //assuming that the return can only be a 32-bit integer in size.
      3 //Time: 323ms Beats: 48.48%
      4 //Memory: 144MB Beats: 24.24%
      5 class Solution {
      6   int divide(int dividend, int divisor) {
      7       int return_val = (dividend/divisor).toInt();
      8       if(return_val > pow(-2,31)){
      9         if(return_val < pow(2,31)){
     10           return return_val;
     11         }
     12         return (pow(2,31) - 1).toInt();
     13       }
     14       else{
     15         return (pow(-2,31)).toInt();
     16       }
     17   }
     18 }