- ScheduledWalk/석천 . . . . 46 matches
void MoveNext();
MoveNext();
void MoveNext() {
MoveNext 에 대해서 재정의를 해봅시다.
void MoveNext() {
void MoveNext();
void MoveNext() {
전체 MoveNext 에 대해서 Test Case를 작성합니다. 그러면서 필요한 인자들을 생각해내고, 채워갑니다. MoveNext 에서 필요한 인자들은 GetMoveVector 와 MoveRoach, IncrementBoardBlockCount 에서 필요한 인자들의 총 집합이 됩니다.
IntPair MoveNext(IntPair currentRoachPosition, PSTR journey, int currentJourneyPosition, int* board, int maxRow, int maxCol) {
void testMoveNext() {
currentRoachPosition = MoveNext (currentRoachPosition, journey, currentJourneyPosition, board, maxRow, maxCol);
MoveNext 부분 test case 를 pass 하기 위해 실제 구현을 합니다. 이미 구현해둔 GetMoveVector, MoveRoach, IncrementBoardBlockCount 들을 조합하는 일만 하면 됩니다.
IntPair MoveNext(IntPair currentRoachPosition, PSTR journey, int currentJourneyPosition, int* board, int maxRow, int maxCol) {
void testMoveNext() {
currentRoachPosition = MoveNext (currentRoachPosition, journey, currentJourneyPosition, board, maxRow, maxCol);
currentRoachPosition = MoveNext (currentRoachPosition, journey, currentJourneyPosition, board, maxRow, maxCol);
currentRoachPosition = MoveNext (currentRoachPosition, journey, currentJourneyPosition, board, maxRow, maxCol);
testMoveNext();
currentRoachPosition = MoveNext (currentRoachPosition, journey, currentJourneyPosition, board, maxRow, maxCol);
IntPair MoveNext(IntPair currentRoachPosition, PSTR journey, int currentJourneyPosition, int* board, int maxRow, int maxCol);
- Robbery/조현태 . . . . 8 matches
void MoveNextPoint(POINT nowPoint, POINT targetPoint, int nowTime, int targetTime, vector<POINT>& movedPoint)
MoveNextPoint(nowPoint, g_canMovePoints[suchTime][i], nowTime, suchTime, movedPoint);
MoveNextPoint(nowPoint, targetPoint, nowTime + 1, targetTime, movedPoint);
MoveNextPoint(nowPoint, targetPoint, nowTime + 1, targetTime, movedPoint);
MoveNextPoint(nowPoint, targetPoint, nowTime + 1, targetTime, movedPoint);
MoveNextPoint(nowPoint, targetPoint, nowTime + 1, targetTime, movedPoint);
MoveNextPoint(nowPoint, targetPoint, nowTime + 1, targetTime, movedPoint);
MoveNextPoint(g_canMovePoints[0][i], g_canMovePoints[0][i], 0, 0, movedPoint);
- ClassifyByAnagram/김재우 . . . . 4 matches
while ( myEnumerator.MoveNext() )
while( de.MoveNext() )
le.MoveNext();
while( le.MoveNext() )
- 식인종과선교사문제/조현태 . . . . 3 matches
bool MoveNext(vector<party>& moveData, map<int, bool>& isChecked, int where, party left, party right)
if (true == MoveNext(moveData, isChecked, where * (-1), testLeft, testRight))
MoveNext(moveData, isChecked, -1, left, right);
Found 4 matching pages out of 7540 total pages (5000 pages are searched)
You can also click here to search title.
