전체 글
-
53. Maximum Subarray릿코드(LEETCODE) 2020. 2. 13. 16:17
https://leetcode.com/problems/maximum-subarray D 풀이 class Solution { public: int maxSubArray(vector& nums) { int sol = nums[0]; vector arr(nums.size()); for (int i = 0; i < nums.size(); i++) { int cand = arr[i] = nums[i]; for (int j = i+1; j < nums.size(); j++) { cand = cand + nums[j]; arr[i] = max(cand, arr[i]); } sol = max(arr[i], sol); } return sol; } }; class Solution { public: int maxSubArr..
-
392. Is Subsequence릿코드(LEETCODE) 2020. 2. 13. 14:51
https://leetcode.com/problems/is-subsequence O 풀이 class Solution { public: bool isSubsequence(string s, string t) { int nSSize = s.size(); int nTSize = t.size(); int nFindCout = 0; for(int i = 0; i < nTSize; i++ ) { for( int j = nFindCout ; j < nSSize; j++ ) { if( t[i] != s[j] ) break; nFindCout++; i++; } } return nFindCout == nSSize; } }; D 풀이 class Solution { public: bool isSubsequence(string ..
-
1290. Convert Binary Number in a Linked List to Integer릿코드(LEETCODE) 2020. 2. 13. 12:43
https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/ Source shift operation /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: int getDecimalValue(ListNode* head) { int num = head->val; while(head = head->next) num = (num val; return num; } };