thinkphp

A x Point(1)


B x Point(2)


C x Point(3)

thinkphp

import java.util.*;
/*

Distanta minima dintre mai multe puncte

|        
|      x        x
|           x
|          x      x
|              x

thinkphp

/*
1 -> 2 -> 4

1 -> 3 -> 4
*/

class ListNode {

	int val;
	ListNone next;

thinkphp

#include <iostream>
#include <string>
#include <cstring>
using namespace std;

// ============================================================
// Proiect Carte de Vizita ----> Clasa de baza
// ============================================================
class CarteDeVizita {
protected:

thinkphp

/*

Array = 

int a 

Data Structures
---------------
Singly Linked List (Liste Simplu Inlantuite)
Double Linked List (Dublu)

thinkphp

/*
n = 3

n! = n(n-1)!

3! = 6 permutari

1 2 3 
1 3 2  
2 1 3 

thinkphp

/*
P1 , P2, P3 

Panta P1P2 == Panta P2P3 sunt coliniare

m = y2 - y1 / x2 - x1

Panta a doua puncte iti spune cat de inclinata este dreapta care trece prin ele, adica cat de mult creste sau scade valoarea lui y atunci cand x creste

thinkphp

/*
Singly Linked List (Lista Simplu Inlantuita)    (Grafuri-reprezentare prin liste de adiacenta)
--------------------------------------------

Doubly Linked List

Circular Linked List 

node1(info, next) ---> node2(info, next)---> node3(info, next)---> ....->nodeN(info, NULL)

thinkphp

//Problema:
//Se citesc de la tastatura coordonatele a 3 puncte diferite in plan. Decideti daca aceste puncte sunt colineare.


//punct1(x,y)
//punct2(x,y)
//punct3(x,y)

// panta dreptei determinate de segmentul P1P2 = panta dreptei terminate de segmentul P2P3, 

thinkphp

#include <iostream>
#include <string>
#include <cstring>

using namespace std;
// ===============================================
// clasa de baza: carte de vizita
//================================================
class CarteDeVizita {