mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-27 22:43:30 +08:00
Add NumberAppearingOddTimes algorithm (#5633)
This commit is contained in:

committed by
GitHub

parent
f3b2a94e74
commit
b54cc21ade
@ -0,0 +1,23 @@
|
||||
package com.thealgorithms.bitmanipulation;
|
||||
|
||||
import static org.junit.jupiter.api.Assertions.assertEquals;
|
||||
|
||||
import org.junit.jupiter.api.Test;
|
||||
|
||||
class NumberAppearingOddTimesTest {
|
||||
|
||||
@Test
|
||||
void testFindOddOccurrence() {
|
||||
int[] arr1 = {5, 6, 7, 8};
|
||||
assertEquals(12, NumberAppearingOddTimes.findOddOccurrence(arr1));
|
||||
|
||||
int[] arr2 = {2, 3, 5, 4, 5, 2, 4, 3, 5, 2, 4, 4, 2};
|
||||
assertEquals(5, NumberAppearingOddTimes.findOddOccurrence(arr2));
|
||||
|
||||
int[] arr3 = {10, 10, 20, 20, 30};
|
||||
assertEquals(30, NumberAppearingOddTimes.findOddOccurrence(arr3));
|
||||
|
||||
int[] arr4 = {-5, -5, -3, -3, -7, -7, -7};
|
||||
assertEquals(-7, NumberAppearingOddTimes.findOddOccurrence(arr4));
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user