Task description
Write a function:
that, given three integers A, B and K, returns the number of integers within the range [A..B] that are divisible by K, i.e.: { i : A ≤ i ≤ B, i mod K = 0 }For example, for A = 6, B = 11 and K = 2, your function should return 3, because there are three numbers divisible by 2 within the range [6..11], namely 6, 8 and 10. Assume that: Complexity:
class Solution { public int solution(int A, int B, int K) { // write your code in Java SE 8 long a=A; long b=B; long k=K; long count=0; long i=a%k; //System.out.println(a+" "+b+" "+k); if(i!=0){ a=a+Math.abs(i-k); } long j=b%k; if(j!=0){ b=b-(Math.abs(j)); } if(a!=b){ if(a%k==0) count=1; count=count+(b-a)/k; }else{ if(a==0 && b==0){ count=1; }else if(a%k==0){ count=(b/a); }else{ count=0; } } return (int)count; } } 100% 100 out of 100 points
Analysis summary
The solution obtained perfect score.
Detected time complexity:
O(1)
expand allExample tests
expand allCorrectness tests
expand allPerformance tests
big_values4
A, B, K in {1,MAXINT} |
Task description A string S consisting of N characters is called properly nested if: S is empty; S has the form " (U) " where U is a properly nested string; S has the form " VW " where V and W are properly nested strings. For example, string " (()(())()) " is properly nested but string " ()) " isn't. Write a function: class Solution { public int solution(String S); } that, given a string S consisting of N characters, returns 1 if string S is properly nested and 0 otherwise. For example, given S = " (()(())()) ", the function should return 1 and given S = " ()) ", the function should return 0, as explained above. Assume that: N is an integer within the range [ 0 .. 1,000,000 ]; string S consists only of the characters " ( " and/or " ) ". Complexity: expected worst-case time complexity is O(N); expected worst-case space complexity is O(1) (not counting the storage requi...
Comments
Post a Comment