tmux new -s [session name]
ctrl+b d
tmux ls
| /** | |
| * Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. | |
| */ | |
| import java.util.Map; | |
| import java.util.HashMap; | |
| import java.util.Set; | |
| public class MaxPointsOnALine { | |
| public static int maxPoints(Point[] points) { | |
| if(points.length < 2) return points.length; | |
| int pointCount = points.length; |
| #include<stdio.h> | |
| #include<stdlib.h> | |
| #include<netdb.h> | |
| #include<arpa/inet.h> | |
| int main(int argc, char **argv) { | |
| struct hostent *host; | |
| char str[100]; | |
| char addr[INET_ADDRSTRLEN]; |