[B! String] agwã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

agw id:agw

Stringã«é–¢ã™ã‚‹agwã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (12)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

Runã®åˆ—æŒ™ (Main-Lorentz algorithm) - è¿·ã„ã¾ã›ã‚“ã‹ï¼Ÿ
Main-Lorentzã€€Algorithm æ¦‚è¦ æ–‡å—åˆ—ã®runã‚’ã§åˆ—æŒ™ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ runã¯æ–‡å—åˆ—å†…ã«ç¾ã‚Œã‚‹éƒ¨åˆ†æ–‡å—åˆ—ã®ç¹°ã‚Šè¿”ã—ã®ã“ã¨ã§ã€ç‰¹ã«é•·ã•ãŒæ¥µå¤§ã§å‘¨æœŸãŒæœ€å°ã®ã‚‚ã®ã‚’æŒ‡ã™ã£ã½ã„ æƒ…å ±ã¨ã—ã¦ã¯åŒºé–“ã¨å‘¨æœŸã‚’æŒã¡ã€å®Ÿéš›ã«ä½¿ã†ã¨ãã¯(l, r, period)ã¨ã—ã¦s[l, r)ã®å‘¨æœŸãŒperiodã¿ãŸã„ã«æŒã¤ æ³¨æ„ã™ã‚‹ã¹ããªã®ã¯ã€ç¹°ã‚Šè¿”ã—ã¯ãƒ”ãƒƒã‚¿ãƒªã§ã‚ã‚‹å¿…è¦ã¯ãªãã¦(r - l) % period != 0ã§ã‚‚ã‚ˆã„ ãŸã ã—r - l >= 2*periodã§ã‚ã‚‹ã‚‚ã®ã®ã¿ã‚’è€ƒãˆã‚‹ ä¾‹ "mississippi" åŒºé–“: [1, 8), period: 3 é•·ã•3ã®"iss"ãŒ7/3å‘¨æœŸåˆ†ã‚ã‚‹ s[0] != s[0+period(= 3)] ã‹ã¤ s[8] != s[8-period(= 5)]ã ã‹ã‚‰ã“ã‚Œä»¥ä¸Šä¼¸ã°ã›ãªãã¦é•·ã•ãŒæ¥µå¤§ã§ã‚ã‚‹ ã‚ã¨ã¯å‘¨æœŸ1ã§2å‘¨æœŸåˆ†ã®ã‚„ã¤ãŒ3ã¤
agw 2019/11/28
deferred

String

Algorithm

Programming
ãƒªãƒ³ã‚¯
æ–‡å—åˆ—ã®é è‰¯ã„æ„Ÿã˜ã®ç·šå½¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŸã¡ï¼“ - ã‚ãªãŸã¯å˜˜ã¤ãã§ã™ã‹ã¨èžã‹ã‚ŒãŸã‚‰ã€ŒYESã€ã¨ç”ãˆã‚‹ãƒ–ãƒã‚°
æ˜¨æ—¥ã®è¨˜äº‹ã®ç¶šãã§ã™ã€‚ Z algorithm æ–‡å—åˆ—ãŒä¸Žãˆã‚‰ã‚ŒãŸæ™‚ã€å„ i ã«ã¤ã„ã¦ã€ŒS ã¨ S[i:|S|-1] ã®æœ€é•·å…±é€šæŽ¥é è¾žã®é•·ã•ã€ã‚’è¨˜éŒ²ã—ãŸé…åˆ— A ã‚’ O(|S|) ã§æ§‹ç¯‰ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ ä¾‹ãˆã°ã€ aaabaaaab 921034210 ã“ã‚“ãªæ„Ÿã˜ã§ã™ã€‚ Z algorithmã®ãƒ†ã‚¯ãƒ‹ãƒƒã‚¯ã¯Manacherã¨ã‚ˆãä¼¼ã¦ã„ã¾ã™ã€‚ã§ã™ã®ã§ã€ä»¥ä¸‹ã®è§£èª¬è¨˜äº‹ã‚’èªã‚€å‰ã«å°‘ã—è€ƒãˆã¦ã¿ã‚‹ã¨åˆ†ã‹ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ ã•ã¦ã€çµè«–ã‹ã‚‰è¨€ã†ã¨ã€Z algorithmã®ã‚³ãƒ¼ãƒ‰ã¯ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ A[0] = S.size(); int i = 1, j = 0; while (i < S.size()) { while (i+j < S.size() && S[j] == S[i+j]) ++j; A[i] = j; if (j == 0) { ++i; continue;} int k
agw 2019/09/20
String

Algorithm

Programming
ãƒªãƒ³ã‚¯
Animation of Aho-Corasick string matching algorithm
agw 2019/04/24
String

Algorithm

Programming

Visualization
ãƒªãƒ³ã‚¯
TRIE-Optimized Regexp : 404 Blog Not Found
2005å¹´09æœˆ11æ—¥07:06 ã‚«ãƒ†ã‚´ãƒªLightweight Languages TRIE-Optimized Regexp ã“ã‚Œã‚’Perlã§ç›´æŽ¥ä½¿ãˆãŸã‚‰ã†ã‚Œã—ã„ã‚ˆãï¼žãŠãŠã‚‹ ãã¾ãã‚Œæ—¥è¨˜: ã¯ã¦ãªã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’é«˜é€Ÿã«ä»˜ä¸Ž ãã“ã§ã€ã¯ã¦ãªã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’ TRIE ã‚’ä½¿ã£ã¦ä»˜ä¸Žã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ä½œã£ã¦ã¿ã¾ã—ãŸã€‚ ã¨ã„ã†ã‚ã‘ã§ã€ã‚„ã£ã¦ã¿ã¾ã—ãŸã€‚ æœ€åˆã¯Dartsã®XSã‚’ä½œã‚ã†ã¨ã—ãŸã®ã ã‘ã©ã€ã©ã†ã‚‚templateã°ã‚Šã°ã‚Šã®C++ã‚³ãƒ¼ãƒ‰ã¨XSã¯ç›¸æ€§ãŒæ‚ªã„ã€‚ã§ã‚‚Trieã‚’ä½œã‚‹ã ã‘ãªã‚‰ã€Perlã§ã‚‚ãã“ãã“å‡ºæ¥ã‚‹ã—ã€å®Ÿéš›Regexp::Optimizerã‚„Regexp::Assem bleã®ã‚ˆã†ãªãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚‚ã‚ã‚‹ã€‚ãŸã ã“ã‚Œã‚‰ã¯Trieä»¥å¤–ã®Optimizeã‚‚ã—ã¦ã—ã¾ã†ã®ã§ã€ã¡ã‚‡ã£ã¨é‡ãŸã„ã¨ã„ã†ã‚ã‘ã§ã€mk_trie_regexp.plã¨ã„ã†Scriptã‚’ã‚µã‚¯ã£ã¨æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚ ä½¿ã„æ–¹ã¯ç°¡å˜ã€‚/usr/
agw 2019/04/24
String

Algorithm

Programming
ãƒªãƒ³ã‚¯
ãã¾ãã‚Œæ—¥è¨˜: Autolink: å‰æ–¹æœ€é•·ä¸€è‡´ã§ã¯ãªãæœ€é•·ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰å„ªå…ˆä¸€è‡´ã‚’å®Ÿç¾ã™ã‚‹
Hatena ã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ç½®æ›ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒTRIE ãƒ™ãƒ¼ã‚¹ã®æ‰‹æ³•ã«å¤‰æ›´ã«ãªã£ãŸã‚ˆã†ã§ã™ã€‚ä»¥å‰ã« ACæ³•ã§ã‚„ã‚‹æ–¹æ³•ã®è¨˜äº‹ã‚’æ›¸ã„ãŸã®ã§ã™ãŒã€ãã‚Œã¨ä¼¼ãŸã“ã¨ã‚’ã‚„ã£ã¦ã‚‹ã®ã§ã—ã‚‡ã†ã‹ã€‚ ACæ³•ã®ã‚„ã‚Šæ–¹ã¯å˜ç´”ã§ã€å‰æ–¹ã‹ã‚‰æœ€é•·ä¸€è‡´ã§ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’è¦‹ã¤ã‘ã¦ã„ãã¾ã™ã€‚ã“ã‚Œã¾ã§ã¯é•·ã„ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‹ã‚‰é †ç•ªã«è¦‹ã¤ã‘ã¦ã„ãæ–¹æ³•(æœ€é•·ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰å„ªå…ˆä¸€è‡´)ã ã£ãŸãã†ã§ã™ãŒã€å‰æ–¹ã‹ã‚‰è¦‹ã¤ã‘ã¦ã„ãæ–¹æ³•ã ã¨çŸã„ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ãŒå„ªå…ˆã•ã‚Œã‚‹å ´åˆãŒã‚ã‚Šã¾ã™ã€‚ http://d.hatena.ne.jp/ita/20060119/p1 http://d.hatena.ne.jp/hatenadiary/20060119/1137667217 æœ¬æ–‡ï¼šã‚ã„ã†ãˆãŠã‹ããã‘ã“ã•ã—ã™ã›ã KW1 ã„ã† KW2 ã†ãˆãŠã‹ã KW3 ã‹ãã KW4 ããã‘ã“ã•ã— ã¨ã„ã†æ–‡ã§KW1-KW4ã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ãŒãƒžãƒƒãƒã™ã‚‹å ´åˆã€æ–°ã—ããªã£ãŸæ–¹æ³•ã§ã¯ã€Œã„ã†ã€ã¨ã€Œã‹ã
agw 2019/04/24
String

Algorithm

Programming
ãƒªãƒ³ã‚¯
Aho Corasick æ³• - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
é©å½“ãªå˜èªžç¾¤ã‚’å«ã‚€è¾žæ›¸ãŒã‚ã£ãŸã¨ã—ã¾ã™ã€‚ã€Œäº¬éƒ½ã®é«˜å€‰äºŒæ¡ã«ç¾Žå‘³ã—ã„ã¤ã‘éººã®ãŠåº—ãŒã‚ã‚‹ã€*1ã¨ã„ã†æ–‡ç« ãŒå…¥åŠ›ã¨ã—ã¦ä¸Žãˆã‚‰ã‚ŒãŸã¨ãã€ã“ã®æ–‡ç« ä¸ã«å«ã¾ã‚Œã‚‹è¾žæ›¸ä¸ã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’æŠ½å‡ºã—ãŸã„ã€ã¨ã„ã†ã“ã¨ãŒã‚ã‚Šã¾ã™ã€‚ä¾‹ãˆã°è¾žæ›¸ã«ã€Œäº¬éƒ½ã€ã€Œé«˜å€‰äºŒæ¡ã€ã€Œã¤ã‘éººã€ã€Œåº—ã€ã¨ã„ã†å˜èªžãŒå«ã¾ã‚Œã¦ã„ãŸå ´åˆã«ã¯ã€ã“ã‚Œã‚‰ã®å˜èªž(ã¨å‡ºç¾ä½ç½®)ãŒå…¥åŠ›ã«å¯¾ã—ã¦ã®å‡ºåŠ›ã«ãªã‚Šã¾ã™ã€‚ ã“ã®é¡žã®å‡¦ç†ã¯ã€ä»»æ„ã®é–‹å§‹ä½ç½®ã‹ã‚‰éƒ¨åˆ†ä¸€è‡´ã™ã‚‹è¾žæ›¸ä¸ã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’ã™ã¹ã¦å–ã‚Šå‡ºã™å‡¦ç†ã€ã¨ã„ã†ã“ã¨ã§ã€Œå…±é€šæŽ¥é è¾žæ¤œç´¢ (Common Prefix Search)ã€ãªã©ã¨å‘¼ã°ã‚Œã‚‹ãã†ã§ã™ã€‚å½¢æ…‹ç´ è§£æžã€Wikipedia ã‚„ã¯ã¦ãªã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ãƒªãƒ³ã‚¯å‡¦ç†ãªã©ãŒä»£è¡¨çš„ãªå¿œç”¨ä¾‹ã§ã™ã€‚ Aho Corasick æ³• ä»»æ„ã®ãƒ†ã‚ã‚¹ãƒˆã‹ã‚‰è¾žæ›¸ã«å«ã¾ã‚Œã‚‹ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’ã™ã¹ã¦æŠ½å‡ºã™ã‚‹ã¨ã„ã†å‡¦ç†ã®å®Ÿç¾æ–¹æ³•ã¯è‰²ã€…ã¨ã‚ã‚Šã¾ã™ã€‚Aho Corasick æ³•ã¯ãã®æ–¹æ³•ã®ã²ã¨
agw 2016/02/03
deferred

String

Tree

Algorithm

Programming
ãƒªãƒ³ã‚¯
15ç§å§¿åŠ¿è®©å¥³äººæœ€æ·±-ç”·å¥³æ´žæˆ¿æœ€åˆºæ¿€çš„å§¿åŠ¿-æ€§çŸ¥è¯†å¤§å…¨å§¿åŠ¿
agw 2015/12/04
String

Algorithm

Programming
ãƒªãƒ³ã‚¯
æ–‡å—åˆ—æ¤œç´¢ã®ã„ã‚ã„ã‚
2. æ–‡å—åˆ—æ¤œç´¢ã£ã¦ï¼Ÿ â— ãƒ‘ã‚¿ãƒ¼ãƒ³ã¨å‘¼ã°ã‚Œã‚‹æ–‡å—åˆ—ãŒ æ–‡ä¸ã®ã©ã“ã«å˜åœ¨ã™ã‚‹ã‹ã‚’è¦‹ã¤ã‘ã‚‹æ‰‹æ³• â†ãƒ‘ã‚¿ãƒ¼ãƒ³ æ–‡ â€»æŸæœ‰åãƒ‘ã‚¯ãƒ„ã‚¤ãƒœãƒƒãƒˆ 4. Bruteforce(åŠ›ã¾ã‹ã›) â— å®Œå…¨ã«åå‰è² ã‘ã—ã¦ã„ã‚‹ã€‚ â— èª°ã§ã‚‚æ€ã„ã¤ãä»¥ä¸‹ã®ã‚ˆã†ãªæ‰‹æ³•ã§ã‚ã‚‹ã€‚ â‘ æ–‡ä¸ã§ã®æ¯”è¼ƒé–‹å§‹ä½ç½®ã‚’æ±ºã‚ã‚‹ã€‚ â‘¡ ãã“ã‹ã‚‰ãƒ‘ã‚¿ãƒ¼ãƒ³ã¨ä¸€è‡´ã—ã¦ã„ã‚‹ã‹æ¯”è¼ƒã™ã‚‹ã€‚ ä¸ä¸€è‡´ãŒç¢ºå®šã—ãŸæ™‚ç‚¹ã§æ‰“ã¡åˆ‡ã‚Šã€‚ â‘¢ â‘ ï¼Œâ‘¡ã‚’æ–‡ä¸ã®å…¨ã¦ã®ä½ç½®ã«è¡Œã†ã€‚ ä¾‹) ãƒ‘ã‚¿ãƒ¼ãƒ³ : kyubuns æ–‡: x k y u r i k y u b u n s k y u b u n s â†‘ 5. Bruteforce(åŠ›ã¾ã‹ã›) â— å®Œå…¨ã«åå‰è² ã‘ã—ã¦ã„ã‚‹ã€‚ â— èª°ã§ã‚‚æ€ã„ã¤ãä»¥ä¸‹ã®ã‚ˆã†ãªæ‰‹æ³•ã§ã‚ã‚‹ã€‚ â‘ æ–‡ä¸ã§ã®æ¯”è¼ƒé–‹å§‹ä½ç½®ã‚’æ±ºã‚ã‚‹ã€‚ â‘¡ ãã“ã‹ã‚‰ãƒ‘ã‚¿ãƒ¼ãƒ³ã¨ä¸€è‡´ã—ã¦ã„ã‚‹ã‹æ¯”è¼ƒã™ã‚‹ã€‚ ä¸ä¸€è‡´ãŒç¢ºå®šã—ãŸæ™‚ç‚¹ã§æ‰“ã¡åˆ‡ã‚Šã€‚ â‘¢ â‘ ï¼Œâ‘¡ã‚’æ–‡ä¸ã®å…¨ã¦ã®ä½ç½®ã«è¡Œã†ã€‚
agw 2015/12/04
String

Algorithm

Programming
ãƒªãƒ³ã‚¯
Wavelet Treeã‚’ã‚‚ã†ä¸€åº¦ - æ°—ã¾ã¾ãªãƒ–ãƒã‚°
æ–‡å—åˆ—æœ¬ã®ãƒ¡ã‚¤ãƒ³ã§ã‚ã‚‹ã‚¦ã‚§ãƒ¼ãƒ–ãƒ¬ãƒƒãƒˆæœ¨ã‚’ã‚‚ã†ä¸€åº¦ç´ ç›´ã«è¦‹ç›´ã™ã“ã¨ã«ã—ãŸã€‚ é«˜é€Ÿæ–‡å—åˆ—è§£æžã®ä¸–ç•Œâ€•â€•ãƒ‡ãƒ¼ã‚¿åœ§ç¸®ãƒ»å…¨æ–‡æ¤œç´¢ãƒ»ãƒ†ã‚ã‚¹ãƒˆãƒžã‚¤ãƒ‹ãƒ³ã‚° (ç¢ºçŽ‡ã¨æƒ…å ±ã®ç§‘å¦) ä½œè€…: å²¡é‡ŽåŽŸå¤§è¼”å‡ºç‰ˆç¤¾/ãƒ¡ãƒ¼ã‚«ãƒ¼: å²©æ³¢æ›¸åº—ç™ºå£²æ—¥: 2012/12/27ãƒ¡ãƒ‡ã‚£ã‚¢: å˜è¡Œæœ¬è³¼å…¥: 15äºº ã‚¯ãƒªãƒƒã‚¯: 324å›žã“ã®å•†å“ã‚’å«ã‚€ãƒ–ãƒã‚° (5ä»¶) ã‚’è¦‹ã‚‹ Wavelet Treeã«é–¢ã™ã‚‹è‘—è€…ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã¯ä»¥ä¸‹ã§ã‚ã‚‹ã€‚ http://www.slideshare.net/pfi/ss-15916040 ãµã‚‰ãµã‚‰ã¨è«–æ–‡ã‚’çœºã‚ã¦ã„ãŸã‚‰ã€Navarroç¥žã®ã€ŒWavelet Trees for Allã€ã¨ã„ã†ã‚µãƒ¼ãƒ™ã‚¤è«–æ–‡ãŒåŠ ç†ã•ã‚Œã¦æ›´æ–°ã•ã‚Œã¦ã„ãŸã€‚å†…å®¹è‡ªä½“ã¯ã‚ã¾ã‚Šå¤‰ã‚ã£ã¦ã„ãªã„ã¨æ€ã†ãŒå›³ãŒå¢—ãˆã¦ã„ãŸã€‚ä»¥ä¸‹ãŒãã®è«–æ–‡ã§ã‚ã‚‹ã€‚ http://www.dcc.uchile.cl/~gnavarro/ps/jda13.pdf å¤§åŠã®å†…
agw 2013/07/30
deferred

String

Algorithm

Programming
ãƒªãƒ³ã‚¯
é«˜é€Ÿãªæ–‡å—åˆ—ãƒžãƒƒãƒãƒ³ã‚° - æ°—ã¾ã¾ãªãƒ–ãƒã‚°
æœ€è¿‘ã¯ã€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’ä¸å¿ƒã«èª¿ã¹ãŸã‚Šã—ã¦ã„ãŸã‘ã©ã€æ–‡å—åˆ—ãƒžãƒƒãƒãƒ³ã‚°ã‚’è€ƒãˆãŸå ´åˆã€åˆ¥ã®ã‚¢ãƒ—ãƒãƒ¼ãƒã‚‚ã‚ã‚Šã¾ã™ã€‚ãã†ã€grepã®ã‚ˆã†ãªé€æ¬¡æ–‡å—åˆ—æ¤œç´¢ã§ã™ãã€‚ä»¥ä¸‹ã®è§£èª¬ãŒãŠã‚‚ã—ã‚ã„ã§ã™ã€‚ http://www.i.kyushu-u.ac.jp/~takeda/papers/IPSJMagazineC PM.pdf CSAã¨ã‹FM-Indexã«éš ã‚Œã¦ã—ã¾ã£ã¦ã„ã¾ã™ãŒã€å®Ÿã¯ã‹ãªã‚Šå¼·åŠ›ã§ã™ã€‚ç‰¹ã«ã€ã‚¯ã‚¨ãƒªãŒå›ºå®šã§ã€ãƒ†ã‚ã‚¹ãƒˆãŒé »ç¹ã«å¤‰æ›´ã•ã‚Œã‚‹ã‚ˆã†ãªã‚±ãƒ¼ã‚¹ã§ã¯æœ‰åŠ¹ã§ã™ã€‚ä¸ã§ã‚‚ä½¿ã„ã‚„ã™ã®ã¯ã€Aho-Corasickæ³•(ACæ³•)ã§ã™ãã€‚è¤‡æ•°ã®ãƒ‘ã‚¿ãƒ¼ãƒ³ã‚’åŒæ™‚ã«æ¤œç´¢ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚KMPã‚’æ‹¡å¼µã—ãŸæ–¹æ³•ã§ã™ã€‚ ACæ³•ã«ã¤ã„ã¦ã¯ã€æ—¥æœ¬èªžã ã¨ æƒ…å ±æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ä½œè€…: åŒ—ç ”äºŒ,æ´¥ç”°å’Œå½¦,ç…ã€…å €æ£å¹¹å‡ºç‰ˆç¤¾/ãƒ¡ãƒ¼ã‚«ãƒ¼: å…±ç«‹å‡ºç‰ˆç™ºå£²æ—¥: 2002/01ãƒ¡ãƒ‡ã‚£ã‚¢: å˜è¡Œæœ¬è³¼å…¥: 6äºº ã‚¯ãƒªãƒƒã‚¯: 552å›žã“ã®å•†å“ã‚’å«ã‚€ãƒ–
agw 2013/07/27
deferred

String

Algorithm

Programming
ãƒªãƒ³ã‚¯
æ–‡å—åˆ—ã®ä¸ã‹ã‚‰åŠ¹çŽ‡è‰¯ãã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’æŽ¢ã—å‡ºã›
æ–‡å—åˆ—ã®ä¸ã‹ã‚‰åŠ¹çŽ‡è‰¯ãã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’æŽ¢ã—å‡ºã›ï¼šã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã«å½¹ç«‹ã¤ï¼ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®åŸºæœ¬ï¼ˆ7ï¼‰ï¼ˆ1/4 ãƒšãƒ¼ã‚¸ï¼‰ ãƒ—ãƒã‚°ãƒ©ãƒžãŸã‚‹ã‚‚ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¯çŸ¥ã£ã¦ã„ã¦å½“ç„¶ã®çŸ¥è˜ã§ã™ã€‚ã—ã‹ã—ã€æ•™ç§‘æ›¸çš„ãªçŸ¥è˜ã—ã‹çŸ¥ã‚‰ãªãã¦ã€å®Ÿè·µçš„ãªãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«å½¹ç«‹ã¦ã‚‹ã“ã¨ãŒã§ãã‚‹ã§ã—ã‚‡ã†ã‹ï¼ˆç·¨é›†éƒ¨ï¼‰ å‰å›žã€ŒFirebugã§æŽ¢ç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è¦‹ã¦ã„ã“ã†ã€ã§ã¯ã€æ•°å€¤ã®é›†åˆã®ä¸ã‹ã‚‰ç‰¹å®šã®æ•°å€¤ã‚’æŽ¢ç´¢ã—ã¾ã—ãŸã€‚ä»Šå›žã¯æ–‡å—åˆ—ã®ä¸ã‹ã‚‰æ¤œç´¢ãƒ¯ãƒ¼ãƒ‰ã‚’æŽ¢ç´¢ã—ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ UNIXã®ã‚³ãƒžãƒ³ãƒ‰ãªã‚‰grepã€Javaãªã©ã®ãƒ—ãƒã‚°ãƒ©ãƒ ãªã‚‰æ–‡å—åˆ—ã®indexOfãƒ¡ã‚½ãƒƒãƒ‰ãªã©ã«ç›¸å½“ã™ã‚‹å‡¦ç†ã§ã™ã€‚ åŠ›ä»»ã›æ³• ãã‚Œã§ã¯ä¾‹ã«ã‚ˆã£ã¦æœ€ã‚‚ãƒ™ã‚¿ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ç´¹ä»‹ã‹ã‚‰å§‹ã‚ã¾ã—ã‚‡ã†ã€‚ æ–‡å—åˆ—ã®ä¸ã«æ¤œç´¢ãƒ¯ãƒ¼ãƒ‰ãŒã‚ã‚‹ã‹ã©ã†ã‹èª¿ã¹ã¾ã™ã€‚æ–‡å—åˆ—ã®å…ˆé ã‹ã‚‰1æ–‡å—ãšã¤æ¤œç´¢ãƒ¯ãƒ¼ãƒ‰ã¨æ¯”è¼ƒã—ã¦ã„ãã¾ã™ã€‚ä¸ä¸€è‡´ãŒã‚ã£ãŸã‚‰æ–‡å—åˆ—ã®2æ–‡å—ç›®ã‹ã‚‰1æ–‡å—ãšã¤æ¤œç´¢ãƒ¯ãƒ¼ãƒ‰ã¨æ¯”è¼ƒã—
agw 2009/10/16
deferred

Algorithm

Programming
ãƒªãƒ³ã‚¯
ãã¾ãã‚Œæ—¥è¨˜: ã¯ã¦ãªã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’é«˜é€Ÿã«ä»˜ä¸Ž
agw 2009/05/15
ACæ³•ã€‚

String

Algorithm

Programming
ãƒªãƒ³ã‚¯
1