[プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°] ビット並列アルゴリズムを使ã£ãŸç·¨é›†è·é›¢ - tsubosakaã®æ—¥è¨˜ãµã¨ã€ãƒ“ット並列アルゴリズムを使ã£ãŸç·¨é›†è·é›¢ã‚’計算ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を書ããŸããªã£ãŸã®ã§æ›¸ã„ã¦ã¿ãŸã€‚ ã¾ãšã€é€šå¸¸ã®ç·¨é›†è·é›¢ã§ã‚ã‚‹Levenshtein Distanceを求ã‚るアルゴリズムã¯ä»¥ä¸‹ã®ã‚ˆã†ã«æ›¸ã‘ã‚‹ int levenshteinDistance(String A, String B) { int m = A.length(); int n = B.length(); int dp[] = new int[n + 1]; int next[] = new int[n + 1]; for (int i = 0; i <= n; i++) dp[i] = i; for (int i = 1; i <= m; i++) { next[0] = i; for (int j = 1; j <= n; j++) { if (A.charAt(i - 1) == B.charAt(j - 1))
![[プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°] ビット並列アルゴリズムを使ã£ãŸç·¨é›†è·é›¢ - tsubosakaã®æ—¥è¨˜](https://cdn-ak-scissors.b.st-hatena.com/image/square/7ca3ca3d9a967967d3c1900062079765c7d58c98/height=288;version=1;width=512/https%3A%2F%2Fcdn.image.st-hatena.com%2Fimage%2Fscale%2F3b21b9940827376b8faf757c1dcc041507e62d8d%2Fbackend%3Dimagemagick%3Bversion%3D1%3Bwidth%3D1300%2Fhttps%253A%252F%252Fcdn-ak.f.st-hatena.com%252Fimages%252Ffotolife%252Ft%252Ftsubosaka%252F20091103%252F20091103000001.jpg)
min_heapを用ã„ãŸä¸Šä½r個ã®è¦ç´ ã®æŠ½å‡º - tsubosakaã®æ—¥è¨˜
検索エンジンã¯ã„ã‹ã«ã—ã¦å‹•ãã®ã‹ï¼Ÿ 記事一覧 | gihyo.jp
{{#tags}}- {{label}}
{{/tags}}