26
61%

Ran 19 Mar 2018 05:41AM UTC

Jobs 2

Files 22

Run time 4s

Badge

Embed ▾

pending completion

Build # 26

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

435 of 618 relevant lines covered (70.39%)

124.37 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	26.1	19 Mar 2018 05:41AM UTC	0	68.79	Travis Job 26.1
2	26.2	19 Mar 2018 05:41AM UTC	0	70.39	Travis Job 26.2

Source Files on build 26

Detailed source file information is not available for this build.

dpaukov / classic-cherries / 26
61%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 26

dpaukov / classic-cherries / 26 61%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 26

dpaukov / classic-cherries / 26
61%

README BADGES
x