Can anyone give me suggestion about approach to Two pointer.Good Articles, Video link,Or good description!!
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 15.11.2024 05:37:35 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
http://bfy.tw/6zFg
First,you can read a very good book:_Introduction to Algorithms_,it has this algorithm,and you can consult this blog or this one,too.After Basic understanding two pointers,you can practise with some problems.Such as uva 1121,Poj 3320 or 2566,codeforces 264A or 190D.And then I think you will learn it well.Come on !^_^
Which writer does the book belongs?
"Introduction to algorithms" by Thomas Thomas H.Cormen,Charles E.Leiserson,Ronald L.Rivest and Clifford Stein four people oversee (Clifford Stein is the second edition began to participate in co-author).
Is quicksort's partition technique also considered two-pointer? In that case, I found this nice problem, I'd call it a 3 pointer — try to solve it O(n) time one pass with O(1) memory: https://leetcode.com/problems/sort-colors/