GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — algorithm_basic_java/src/test/java/bit/BitMapTest.java at master · jbee37142/algorithm_basic_java Expand file tree/ Copy pathBitMapTest.javaMore file actions 44 lines (35 loc) · 1.1 KB / Copy pathBitMapTest.javaFile metadata and controls44 lines (35 loc) · 1.1 KB 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 package bit; import org.junit.Test; import static org.hamcrest.CoreMatchers.is; import static org.junit.Assert.assertThat; public class BitMapTest { /* TASK O(1)으로 해당 데이터가 존재하는지 판단한다. */ @Test public void test() { BitMap bitMap = new BitMap(); bitMap.store("1234567"); assertThat(bitMap.exist("1234567"), is(true)); assertThat(bitMap.exist("1234568"), is(false)); } public class BitMap { public int[] cache; public BitMap() { cache = new int[(10 * 1000 * 1000) / 32]; } public void store(String data) { int dataInt = Integer.parseInt(data); int arrIndex = dataInt / 32; int byteIndex = dataInt % 32; cache[arrIndex] = cache[arrIndex] | (1 << byteIndex); } public boolean exist(String data) { int dataInt = Integer.parseInt(data); int arrIndex = dataInt / 32; int byteIndex = dataInt % 32; return (cache[arrIndex] & (1 << byteIndex)) != 0; } } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |