Part 1 function getTotal() { //convert object to an array var args = Array.prototype.slice.call(arguments); if (args.length === 2) { return args[0] + args[1]; } else if (args.length === 1) { return function(num2) { return args[0] + num2; }; } } console.log(getTotal(10, 20)); console.log(getTotal(5, 40)); console.log(getTotal(3)(30)); console.log(getTotal(8)(12)); Output: 30 45 33 20 Process finished
Part 2 An IIFE (Immediately Invoked Function Expression) is a JavaScript function that runs as soon as it is defined. (function doubleNumber(num) { return num * 2; })(10); (function () { function getTotal(a, b) { return a + b; } var $ = 'currency'; if (true) console.log('hello world'); })(); Create 5
Easy Solution 1: HashMap put all numbers x into HashMap<Integer,Boolean> O(n) traversal array to find if y in the HashMap (y=tragetSum-x) O(n) Time complexity: O(n) Space complexity: O(n) Solution 2: Two pointers Sort the arrray. O(nLogn) use Left and Right pointer shrinking the sum to targetSum. O(n) Time complexity: O(n Log n)
Maximum Sum Subarray of Size K (easy) Problem Statement Given an array of positive numbers and a positive number ‘k’, find the maximum sum of any contiguous subarray of size ‘k’. Example 1: 1 2 3 Input: [2, 1, 5, 1, 3, 2], k=3 Output: 9 Explanation: Subarray with maximum sum is [5, 1,
Iframes not supported
[php]class Solution3 {public:int lengthOfLongestSubstring(string s) {set<char> set;int ans=0,i=0,j=0;while (i<s.size()&&j<s.size()) {if (!set.count(s[j])) {set.insert(s[j++]);ans=max(ans, j-i);}else{set.erase(s[i++]);}}return ans;}};int main(){Solution3 s3; cout<<s3.lengthOfLongestSubstring("abcabcbb");}[/php][php]int main(int argc, char *argv[])[/php] //Bulid_Max_Heap' void Bulid_Max_Heap2(vector& A){ Heap_size=1; for (int i=1; i<A.size(); i++) { MAX_HEAP_INSERT(A,A[i]); } } void MAX_HEAP_INSERT(vector& A,int key){ Heap_size=Heap_size+1; // A.push_back(NULL); //don't use when invoke Bulid_Max_Heap2 function A[Heap_size-1]=INT_MIN; Heap_Increase_Key(A, Heap_size-1, key); } //Bulid_Max_Heap' void
Fusce nec erat sed nisl lobortis eleifend. In eu fringilla leo. Curabitur dignissim efficitur lorem nec fermentum. Etiam laoreet est facilisis consequat aliquam. Nullam sollicitudin pulvinar arcu, porttitor dictum orci luctus sagittis. Fusce vestibulum nibh augue, ut luctus urna feugiat eu. Mauris aliquet dictum sem, vel pellentesque nisi cursus eget. "Quisque
Aliquam commodo nulla ligula. Curabitur ut nunc id nisl scelerisque egestas. Nulla vulputate mauris eget nisl rhoncus viverra vel eu mi. Integer iaculis tortor eget lectus laoreet congue. Pellentesque eget convallis leo. Proin porttitor tincidunt eros. Class aptent taciti sociosqu ad litora torquent per conubia nostra, per inceptos himenaeos. "Quisque eleifend
Etiam hendrerit tortor gravida accumsan condimentum. Nunc ut mi vitae neque feugiat hendrerit at sed sem. Maecenas ante nisi, rhoncus a accumsan in, consequat at dui. Proin non volutpat odio. Ut ipsum leo, tristique sit amet felis ut, iaculis pharetra elit. Donec rutrum interdum tempus. Cum sociis natoque penatibus et magnis dis parturient montes.
