A step forward every day

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal t ...

Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. overflow特殊情况：-2147483648 / (-1) = ...

本篇文章将会介绍如何在Linux下配置使Git在push/pull时免密码

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

介绍如何在Linux下调整交换分区swap的使用条件

动态规划

T Sum问题的O(n)解决方法；

N Sum类的问题的一般解决方法；

Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1- ...

本文主要通过一些例子介绍tensorflow中两种变量的声明方式和两种scope

Problem Description Bo is a “Life Winner”.He likes playing chessboard games with his girlfriend G.The size of the chessboard is N×M.The top left corn ...