Find all injective functions$f:\mathbb{Z}\to \mathbb{Z}$ that satisfy: 
$\left| f\left( x \right)-f\left( y \right) \right|\le \left| x-y \right|$ ,for any $x,y\in \mathbb{Z}$.
1. **Substitute \( x = y + 1 \) into the given inequality:**
   \[
   |f(y+1) - f(y)| \leq |(y+1) - y| = 1
   \]
   Since \( f \) is injective, \( f(y+1) \neq f(y) \). Therefore, the only way the inequality can hold is if:
   \[
   |f(y+1) - f(y)| = 1
   \]

2. **Consider the initial value \( f(0) = a \):**
   \[
   |f(1) - f(0)| = 1 \implies |f(1) - a| = 1
   \]
   This gives us two possibilities:
   \[
   f(1) = a + 1 \quad \text{or} \quad f(1) = a - 1
   \]

3. **Case 1: \( f(1) = a + 1 \):**
   We will use induction to show that \( f(n) = a + n \) for all \( n \geq 0 \).

   - **Base case:** For \( n = 0 \) and \( n = 1 \), we have:
     \[
     f(0) = a \quad \text{and} \quad f(1) = a + 1
     \]
   - **Inductive step:** Assume \( f(k) = a + k \) and \( f(k+1) = a + k + 1 \). We need to show \( f(k+2) = a + k + 2 \).
     \[
     |f(k+2) - f(k+1)| = 1 \implies f(k+2) = f(k+1) + 1 \quad \text{or} \quad f(k+2) = f(k+1) - 1
     \]
     Since \( f(k+1) = a + k + 1 \), we have:
     \[
     f(k+2) = (a + k + 1) + 1 = a + k + 2 \quad \text{or} \quad f(k+2) = (a + k + 1) - 1 = a + k
     \]
     But \( f \) is injective, so \( f(k+2) \neq f(k) \). Therefore:
     \[
     f(k+2) = a + k + 2
     \]
     By induction, \( f(n) = a + n \) for all \( n \geq 0 \).

4. **Extend to negative integers:**
   - **Base case:** For \( n = 0 \) and \( n = -1 \), we have:
     \[
     f(0) = a \quad \text{and} \quad f(-1) = a - 1
     \]
   - **Inductive step:** Assume \( f(k) = a + k \) and \( f(k-1) = a + k - 1 \). We need to show \( f(k-2) = a + k - 2 \).
     \[
     |f(k-2) - f(k-1)| = 1 \implies f(k-2) = f(k-1) + 1 \quad \text{or} \quad f(k-2) = f(k-1) - 1
     \]
     Since \( f(k-1) = a + k - 1 \), we have:
     \[
     f(k-2) = (a + k - 1) + 1 = a + k \quad \text{or} \quad f(k-2) = (a + k - 1) - 1 = a + k - 2
     \]
     But \( f \) is injective, so \( f(k-2) \neq f(k) \). Therefore:
     \[
     f(k-2) = a + k - 2
     \]
     By induction, \( f(n) = a + n \) for all \( n \leq 0 \).

5. **Case 2: \( f(1) = a - 1 \):**
   We will use induction to show that \( f(n) = a - n \) for all \( n \geq 0 \).

   - **Base case:** For \( n = 0 \) and \( n = 1 \), we have:
     \[
     f(0) = a \quad \text{and} \quad f(1) = a - 1
     \]
   - **Inductive step:** Assume \( f(k) = a - k \) and \( f(k+1) = a - (k + 1) \). We need to show \( f(k+2) = a - (k + 2) \).
     \[
     |f(k+2) - f(k+1)| = 1 \implies f(k+2) = f(k+1) + 1 \quad \text{or} \quad f(k+2) = f(k+1) - 1
     \]
     Since \( f(k+1) = a - (k + 1) \), we have:
     \[
     f(k+2) = (a - (k + 1)) + 1 = a - k \quad \text{or} \quad f(k+2) = (a - (k + 1)) - 1 = a - (k + 2)
     \]
     But \( f \) is injective, so \( f(k+2) \neq f(k) \). Therefore:
     \[
     f(k+2) = a - (k + 2)
     \]
     By induction, \( f(n) = a - n \) for all \( n \geq 0 \).

6. **Extend to negative integers:**
   - **Base case:** For \( n = 0 \) and \( n = -1 \), we have:
     \[
     f(0) = a \quad \text{and} \quad f(-1) = a + 1
     \]
   - **Inductive step:** Assume \( f(k) = a - k \) and \( f(k-1) = a - (k - 1) \). We need to show \( f(k-2) = a - (k - 2) \).
     \[
     |f(k-2) - f(k-1)| = 1 \implies f(k-2) = f(k-1) + 1 \quad \text{or} \quad f(k-2) = f(k-1) - 1
     \]
     Since \( f(k-1) = a - (k - 1) \), we have:
     \[
     f(k-2) = (a - (k - 1)) + 1 = a - k \quad \text{or} \quad f(k-2) = (a - (k - 1)) - 1 = a - (k - 2)
     \]
     But \( f \) is injective, so \( f(k-2) \neq f(k) \). Therefore:
     \[
     f(k-2) = a - (k - 2)
     \]
     By induction, \( f(n) = a - n \) for all \( n \leq 0 \).

Hence, the solutions are:
\[
f(x) = a + x \quad \text{or} \quad f(x) = a - x \quad \text{for any integer } a.
\]

The final answer is \( \boxed{ f(x) = a + x } \) or \( f(x) = a - x \) for any integer \( a \).