LeetCode #021 MergeTwoSortedLists. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #021 MergeTwoSortedLists. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 노드 구조체를 포인터 써서 이동함. 퍼포먼스 중상, 메모리 상 LeetCode #21 Q. Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 두개의 정렬된 연결리스트를 병합해서 새로운 리스..
C++ Math - sqrt (square root, 제곱근, 루트). stl, math.h, 씨쁠쁠, example code, 예제코드
C++ Math - sqrt (squareRoot, 제곱근)C++ Math - sqrt (squareRoot, 제곱근). stl, math.h, 씨쁠쁠, example code, 예제코드C++ Math - sqrt (square root, 제곱근, 루트). stl, math.h, 씨쁠쁠, example code, 예제코드 math.h 헤더 추가해주고, sqrt -> 제곱근 (square root) 반환되는 자료형만 차이가 있고 sqrt, sqrtf, sqrtl 다 같은 기능 There are some difference between sqrt, sqrtf, and sqrtl. All is the same square root function, but return type. msdn below https:..
LeetCode #83 RemoveDuplicatesFromSortedList. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #83 RemoveDuplicatesFromSortedList. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 노드 구조체를 포인터 써서 이동함. 퍼포먼스 100% Move using node struct. 100% performance.. LeetCode #83 Q. Given a sorted linked list, delete all duplicates such that each element appear only once. 주어진 정렬된 연결리스트에서, 중복되는 인자들을 다 ..
LeetCode #100 SameTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, dynamicProgramming
LeetCode #100 SameTree. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, dynamicProgramming 술 취해서 제정신 아님,, leetcode compiler 좀 이상한듯?? null 검사 안하면 if 문에서 compile 안돼서 좀 헤멤.. I'm kinda wasted,, and leetcode compiler was weired.. or me?? If i don't check NULL, then it return compiler error,,, in if statem..
LeetCode #169 MajorityElement. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #169 MajorityElement. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 퍼포먼스 어정쩡할 느낌이었는데 98% 나옴. std::find 포스팅 하자마자 find 쓰는 문제 풀어서 상쾌함 I thought it's performance would not that good, but it's 98%. Also I'm proud of me, cuz I posted std::find function right before it and I solved this using that..
LeetCode #202 HappyNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접
LeetCode #202 HappyNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접 30분정도.. 3번 제출.. 퍼포먼스 100%.. 30min.. submit 3 times.. 100% performance.. LeetCode #202 Q. Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any pos..
LeetCode #287 FindTheDuplicateNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, dyna..
LeetCode #287 FindTheDuplicateNumber. Algorithm,알고리즘,LeetCode,Codefights,CodeSignal,코드파이트,코드시그널,예제,문제해결능력,example,c++,java,재귀,recursive,datastructure,techinterview,coding,코딩인터뷰,기술면접, dynamicProgramming 퍼포먼스 99프로 99% performance LeetCode #287 Q. Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Ass..
