Taras Tsugrii ttsugriy
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int minMoves(const vector& nums) { | |
| int base = *min_element(nums.cbegin(), nums.cend()); | |
| return accumulate(nums.cbegin(), nums.cend(), 0) - base * nums.size(); | |
| } |
ttsugriy
/ min_moves.cpp
Created
December 19, 2016 06:44
https://leetcode.com/problems/minimum-moves-to-equal-array-elements/
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int minMoves(vector<int>& nums) { | |
| int base = numeric_limits<int>::max(); | |
| int sum = 0; | |
| for (int i = 0; i < nums.size(); ++i) { | |
| sum += nums[i]; | |
| base = min(base, nums[i]); | |
| } | |
| return sum - base * nums.size(); | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| movdqa xmm1, xmm0 | |
| psrldq xmm1, 8 | |
| paddd xmm0, xmm1 | |
| movdqa xmm1, xmm0 | |
| psrldq xmm1, 4 | |
| paddd xmm0, xmm1 |
ttsugriy
/ skylark-lang.patch
Created
August 15, 2017 18:46
Patch to turn skylark-lang into java_binary.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| diff --git a/src/main/java/com/google/devtools/build/lib/BUILD b/src/main/java/com/google/devtools/build/lib/BUILD | |
| index d4e18ecf8..0beac7230 100644 | |
| --- a/src/main/java/com/google/devtools/build/lib/BUILD | |
| +++ b/src/main/java/com/google/devtools/build/lib/BUILD | |
| @@ -434,14 +434,34 @@ java_library( | |
| # | |
| # IMPORTANT: NOT A PUBLIC INTERFACE. TARGETS SHOULDN'T DEPEND ON THIS. | |
| # | |
| -java_library( | |
| +java_binary( |
ttsugriy
/ MyBenchmark.java
Created
July 25, 2018 01:07
Dynamic proxy vs plain getter JMH benchmark.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package org.sample; | |
| import org.openjdk.jmh.annotations.Benchmark; | |
| import org.openjdk.jmh.annotations.Scope; | |
| import org.openjdk.jmh.annotations.State; | |
| import java.lang.annotation.Retention; | |
| import java.lang.annotation.RetentionPolicy; |
ttsugriy
/ patch.diff
Created
December 3, 2018 22:37
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| diff --git a/rules/attributes/printer.bzl b/rules/attributes/printer.bzl | |
| index 1a7abf1..facd739 100644 | |
| --- a/rules/attributes/printer.bzl | |
| +++ b/rules/attributes/printer.bzl | |
| @@ -18,8 +18,8 @@ def _impl(ctx): | |
| printer = rule( | |
| implementation = _impl, | |
| attrs = { | |
| + "deps": attr.label_list(allow_files = True), | |
| # Do not declare "name": It is added automatically. |
ttsugriy
/ valid_parenthesis.rs
Created
January 1, 2019 05:04
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| impl Solution { | |
| pub fn is_valid(s: String) -> bool { | |
| let mut stack = Vec::new(); | |
| let match_of = |c: char| -> char { | |
| match c { | |
| ')' => '(', | |
| '}' => '{', | |
| ']' => '[', | |
| _ => panic!("Invalid closing bracket"), | |
| } |
ttsugriy
/ intersection_of_two_linked_lists.cpp
Created
January 1, 2019 05:21
intersection-of-two-linked-lists
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Definition for singly-linked list. | |
| * struct ListNode { | |
| * int val; | |
| * ListNode *next; | |
| * ListNode(int x) : val(x), next(NULL) {} | |
| * }; | |
| */ | |
| class Solution { | |
| private: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Solution { | |
| public: | |
| int maxWidthRamp(vector<int>& A) { | |
| map<int, int> largest; | |
| largest[A.back()] = A.size()-1; | |
| int max_width = 0; | |
| for (int i = A.size()-2; i >= 0; --i) { | |
| auto found = largest.lower_bound(A[i]); | |
| if (found != largest.cend()) { | |
| max_width = max(max_width, found->second - i); |
ttsugriy
/ maximum_width_ramp.rs
Created
January 4, 2019 07:58
Maximum width ramp in Rust (https://leetcode.com/problems/maximum-width-ramp/)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| impl Solution { | |
| pub fn max_width_ramp(a: Vec<i32>) -> i32 { | |
| let mut largest: Vec<usize> = vec![(a.len()-1) as usize]; | |
| for (i, val) in a.iter().enumerate().rev().skip(1) { | |
| if *val > a[*largest.last().unwrap()] { | |
| largest.push(i); | |
| } | |
| } | |
| let mut max_width = 0; | |
| for (i, val) in a.iter().enumerate() { |
OlderNewer