1
61%
master: 61%

Ran 19 Mar 2018 05:41AM UTC

Files 22

Run time 1s

Badge

Embed ▾

Committed 19 Mar 2018 05:39AM UTC coverage: 68.791% (-1.3%) from 70.05%

Job # 26.1

Build Type

push

travis-ci

Committed by

dpaukov

Commit Message

 Add solution for the Hamming distance issue.

 The Hamming distance between two integers is the number of positions at which the corresponding
 bits are different. Given two integers x and y, calculate the Hamming distance.
 Note: 0 ≤ x, y < 2^31.

  https://leetcode.com/problems/hamming-distance/description/

 Example:
 Input: x = 1, y = 4
 Output: 2
 Explanation:
 1   (0 0 0 1)
 4   (0 1 0 0)

Run Details

421 of 612 relevant lines covered (68.79%)

63.72 hits per line

dpaukov / classic-cherries / 26 / 1
61%
master: 61%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 26.1

dpaukov / classic-cherries / 26 / 1 61% master: 61%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 26.1

dpaukov / classic-cherries / 26 / 1
61%
master: 61%

README BADGES
x