mockMvc.perform(MockMvcRequestBuilders.get("/some_api_endpoint")
        .contentType(MediaType.APPLICATION_JSON))
        .andExpect(status().isOk())
        .andExpect(jsonPath("$[0].user_id").value("123"));

public interface ResultActions {

  ResultActions andExpect(ResultMatcher matcher) throws Exception;

  ResultActions andDo(ResultHandler handler) throws Exception;

  MvcResult andReturn();

}

@FunctionalInterface
public interface ResultMatcher {
  void match(MvcResult result) throws Exception;
  static ResultMatcher matchAll(ResultMatcher... matchers) {
    return result -> {
      for (ResultMatcher matcher : matchers) {
        matcher.match(result);
      }
    };
  }
}

helloFromFunction("world", "wrongwrong", (subject, name) -> System.out.println("Hello " + subject + ", I'm " + name + "."));

echo date('Ym', strtotime('next month'));

<?php 
$date = "2018-01-31";
 
 $ym1 = date('Y-m', strtotime('+1 month ' . $date));
 $ym2 = date('Y-m', strtotime('+2 month ' . $date));
 $ym3 = date('Y-m', strtotime('+3 month ' . $date));
  
  var_dump($date);
  var_dump($ym1);
  var_dump($ym2);
  var_dump($ym3);

string(10) “2018-01-31”
string(7) “2018-02”
string(7) “2018-03”
string(7) “2018-04”

string(10) “2018-01-31”
string(7) “2018-03”
string(7) “2018-03”
string(7) “2018-05”

$date = date("Y-m-01");
$ym1 = date('Y-m', strtotime('+1 month ' . $date));

#docker-compose.yml
  redisCluster:
    image: grokzen/redis-cluster:3.2.13

#application.properties
spring.redis.cluster.nodes[0]=notification_redis:7000
spring.redis.cluster.nodes[1]=notification_redis:7001
spring.redis.cluster.nodes[2]=notification_redis:7002
spring.redis.cluster.nodes[3]=notification_redis:7003
spring.redis.cluster.nodes[4]=notification_redis:7004
spring.redis.cluster.nodes[5]=notification_redis:7005

@Data
@Configuration
@ConfigurationProperties(prefix = "spring.redis.cluster")
public class RedisClusterConf {

    List<String> nodes;

    @Bean
    public RedisConnectionFactory connectionFactory() {
        return new JedisConnectionFactory(new RedisClusterConfiguration(nodes));
    }
    @Bean
    public RedisTemplate<String, MyObject> redisKvTemplate(@Qualifier("connectionFactory") RedisConnectionFactory factory){
        RedisTemplate<String, Object> template = new RedisTemplate <>();
        template.setConnectionFactory(factory);

        Jackson2JsonRedisSerializer jackson2JsonRedisSerializer =new Jackson2JsonRedisSerializer<>(MyObject.class);

        StringRedisSerializer stringRedisSerializer = new StringRedisSerializer();
        template.setKeySerializer(stringRedisSerializer);
        //template.setHashKeySerializer(stringRedisSerializer);
        template.setValueSerializer(jackson2JsonRedisSerializer);
        //template.setHashValueSerializer(jackson2JsonRedisSerializer);
        return template;
    }

}

Jackson2JsonRedisSerializer jackson2JsonRedisSerializer =new Jackson2JsonRedisSerializer<>(MyObject.class);
StringRedisSerializer stringRedisSerializer = new StringRedisSerializer();
template.setKeySerializer(stringRedisSerializer);
template.setValueSerializer(jackson2JsonRedisSerializer);

//template.setHashKeySerializer(stringRedisSerializer);
//template.setHashValueSerializer(jackson2JsonRedisSerializer);

rabbitmq:
  image: rabbitmq:management
  ports:
    - "5672:5672"
    - "15672:15672"

dependencies {
    implementation 'org.springframework.boot:spring-boot-starter-amqp'
      testImplementation('org.springframework.boot:spring-boot-starter-test') {
            exclude group: 'org.junit.vintage', module: 'junit-vintage-engine'
      }
        testImplementation 'org.springframework.amqp:spring-rabbit-test'
}

@EnableRabbit
public class AmqpConf implements RabbitListenerConfigurer {

    @Bean
    public MappingJackson2MessageConverter jackson2Converter() {
        MappingJackson2MessageConverter converter = new MappingJackson2MessageConverter();
        return converter;
    }

    @Bean
    public DefaultMessageHandlerMethodFactory myHandlerMethodFactory() {
        DefaultMessageHandlerMethodFactory factory = new DefaultMessageHandlerMethodFactory();
        factory.setMessageConverter(jackson2Converter());
        return factory;
    }

    @Override
    public void configureRabbitListeners(RabbitListenerEndpointRegistrar registrar) {
        registrar.setMessageHandlerMethodFactory(myHandlerMethodFactory());
    }

}

class Receiver {
    @RabbitListener(queues = "queue")
    public void receiveMessage(Foo foo) {
        System.out.println("Received <" + foo.name + ">");
    }
}

class Foo {
    public String name;
}

:set bomb?

> bomb
> nobomb

:set nobomb

[24] Swap Nodes in Pairs  

https://leetcode.com/problems/swap-nodes-in-pairs/description/

* algorithms
* Medium (45.98%)
* Total Accepted:    352.7K
* Total Submissions: 762.9K
* Testcase Example:  '[1,2,3,4]'

Given a linked list, swap every two adjacent nodes and return its head.

You may not modify the values in the list's nodes, only nodes itself may be changed.

 

Example:


Given 1->2->3->4, you should return the list as 2->1->4->3.

# Definition for singly-linked list.
# class ListNode
#     attr_accessor :val, :next
#     def initialize(val)
#         @val = val
#         @next = nil
#     end
# end

# @param {ListNode} head
# @return {ListNode}
def swap_pairs(head)
  return head if head == nil || head.next == nil
  tail = head.next
  left = tail.next
  tail.next = head
  head.next = swap_pairs(left)
  return tail
end

[23] Merge k Sorted Lists  

https://leetcode.com/problems/merge-k-sorted-lists/description/

* algorithms
* Hard (35.68%)
* Total Accepted:    444.4K
* Total Submissions: 1.2M
* Testcase Example:  '[[1,4,5],[1,3,4],[2,6]]'

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Example:


Input:
[
  1->4->5,
  1->3->4,
  2->6
]
Output: 1->1->2->3->4->4->5->6

def merge_k_lists(lists)
  if lists.count == 0
    return nil
  end
  if lists.count == 1
    return lists[0]
  end
  if lists.count == 2
    return merge_two_lists(lists[0], lists[1])
  else
    list = merge_k_lists(lists[1..-1])
    return merge_two_lists(lists[0], list)
  end
end

def merge_two_lists(l1, l2)
  i = l1
  j = l2
  if l1 == nil
      return l2 ? l2 : nil
  elsif l2 == nil
      return l1 ? l1 : nil
  end
  if l1.val > l2.val 
    head = l2
    j = j.next
  else
    head = l1
    i = i.next
  end
  current = head
  while i && j
    if i.val < j.val
      current.next = i
      i = i.next
    else
      current.next = j
      j = j.next
    end
    current = current.next
  end
  while i
    current.next = i
    i = i.next
    current = current.next
  end
  while j
    current.next = j
    j = j.next
    current = current.next
  end
  return head
end

class Solution {
public:
    struct compNode {
        bool operator()(ListNode *p, ListNode *q) const {
            return p->val>q->val;
        }  
    };

    ListNode *mergeKLists(vector<ListNode *> &lists) {
        priority_queue<ListNode*, vector<ListNode*>, compNode> pq;
        ListNode *dummy = new ListNode(0), *tail = dummy;
        
        for(int i=0; i<lists.size(); i++) 
            if(lists[i]) pq.push(lists[i]);
            
        while(!pq.empty()) {
            tail->next = pq.top();
            tail = tail->next;
            pq.pop();
            if(tail->next) pq.push(tail->next);
        }
        
        return dummy->next;
    }
};

[22] Generate Parentheses  

https://leetcode.com/problems/generate-parentheses/description/

* algorithms
* Medium (56.57%)
* Total Accepted:    386.8K
* Total Submissions: 680.5K
* Testcase Example:  '3'


Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.



For example, given n = 3, a solution set is:


[
  "((()))",
  "(()())",
  "(())()",
  "()(())",
  "()()()"
]

"("+generateParenthesis(n-1)+")"
"()"+generateParenthesis(n-1)
generateParenthesis(n-1)+"()"

# @param {Integer} n
# @return {String[]}
def generate_parenthesis(n)
  stack = []
  generate(n,0,0,"",stack)
  return stack
end

def generate(n, left, right, current, stack)
  if left == n && right == n
    stack << current
  end
  if left < n
    generate(n, left+1, right, current+"(", stack)
  end
  if right < left
    generate(n, left, right+1, current+")", stack)
  end
end

class Solution {
public:
    vector<string> generateParenthesis(int n) {
        vector<string> allComb;
        string comb;
        findParenthesis(n, 0, 0, comb, allComb);
        return allComb;
    }
    
    void findParenthesis(int n, int nleft, int nright, string &comb, vector<string> &allComb) {
        if(nleft==n && nright==n) {
            allComb.push_back(comb);
            return;
        }
        
        if(nleft<n) {
            comb.push_back('(');
            findParenthesis(n, nleft+1, nright, comb, allComb);
            comb.pop_back();
        }
        
        if(nright<nleft) {
            comb.push_back(')');
            findParenthesis(n, nleft, nright+1, comb, allComb);
            comb.pop_back();
        }
    }
};

30 * * * * /usr/bin/docker cp b7ceed2898de003e02b0addee90d0d50c63d046cd422d17dc5ba9085d44ea237:/usr/share/nginx/html/upload /data/pictshareuploads/upload/

server {
       listen 443 http2;

       ssl on;
       server_name  www.bocchi.tokyo;
       ssl_certificate /etc/letsencrypt/live/www.bocchi.tokyo/fullchain.pem;
       ssl_certificate_key /etc/letsencrypt/live/www.bocchi.tokyo/privkey.pem;
       root /var/www/myblog;
       index index.html;

       location / {
          add_header Cache-Control max-age=0;
          add_header Cache-Control no-store;
          add_header Pragma no-cache;
          #rewrite ^ https://$http_host$request_uri? redirect;
          try_files $uri $uri/ =404;
       }
      location /upload/ {
          alias /var/www/html/upload/;
      }
}

#!/bin/bash


md5=`md5 -q "$1"`
filename=$(basename -- "$1")
extension="${filename##*.}"

hashedName="$md5.$extension"

echo "file name is : $hashedName"

# cp $1 /tmp/$hashedName

scp "$1" gyorou@bocchi.tokyo:/var/www/html/upload/$hashedName

if [ $? -eq 0 ]; then
    echo "https://www.bocchi.tokyo/upload/$hashedName" | pbcopy
    echo "copied https://www.bocchi.tokyo/upload/$hashedName to clipboard"
else
    echo FAIL
fi

[15] 3Sum  

https://leetcode.com/problems/3sum/description/

* algorithms
* Medium (24.60%)
* Total Accepted:    631K
* Total Submissions: 2.6M
* Testcase Example:  '[-1,0,1,2,-1,-4]'

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

The solution set must not contain duplicate triplets.

Example:


Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]

# @param {Integer[]} nums
# @param {Integer} target
# @return {Integer}
def three_sum_closest(nums, target)
  sorted = nums.sort
  i = 0
  min = sorted[0] + sorted[1] + sorted[2] - target
  while i < sorted.length - 2
    if i > 0 && sorted[i] == sorted[i-1]
      i+=1
      next
    end
    left = i+1
    right = sorted.length - 1
    while (left < right)
      if (sorted[left] + sorted[right] + sorted[i] - target).abs < min.abs
        min = sorted[left] + sorted[right] + sorted[i] - target
      end
      if sorted[left] + sorted[right] + sorted[i] - target > 0
        right -=1
      elsif sorted[left] + sorted[right] + sorted[i] - target < 0
        left +=1
      else
        return sorted[left] + sorted[right] + sorted[i]
      end
      if left + 1 < right && sorted[left] == sorted[left+1]
        left+=1
        next
      end
      if right - 1 > left && sorted[right] == sorted[right-1]
        right-=1
        next
      end
    end
    i += 1
  end
  return min + target
end

puts three_sum_closest([-1,0,1,1,55], 3)