Updated readmes

Author: javadev

src/main/php/g0001_0100/s0001_two_sum/readme.md

@@ -43,11 +43,6 @@ You can return the answer in any order.
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0001_two_sum;
-
-
 class Solution {
     /**
      * @param Integer[] $nums

src/main/php/g0001_0100/s0002_add_two_numbers/readme.md

@@ -40,11 +40,6 @@ You may assume the two numbers do not contain any leading zero, except the numbe
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0002_add_two_numbers;
-
-
 use leetcode\com_github_leetcode\ListNode;
 
 /**

src/main/php/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md

@@ -45,11 +45,6 @@ Given a string `s`, find the length of the **longest substring** without repeati
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0003_longest_substring_without_repeating_characters;
-
-
 class Solution {
     /**
      * @param String $s

src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays/readme.md

@@ -55,11 +55,6 @@ The overall run time complexity should be `O(log (m+n))`.
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0004_median_of_two_sorted_arrays;
-
-
 class Solution {
     /**
      * @param Integer[] $nums1

src/main/php/g0001_0100/s0005_longest_palindromic_substring/readme.md

@@ -39,11 +39,6 @@ Given a string `s`, return _the longest palindromic substring_ in `s`.
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0005_longest_palindromic_substring;
-
-
 class Solution {
     /**
      * @param String $s

src/main/php/g0001_0100/s0006_zigzag_conversion/readme.md

@@ -44,11 +44,6 @@ string convert(string s, int numRows);
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0006_zigzag_conversion;
-
-
 class Solution {
     /**
      * @param String $s

src/main/php/g0001_0100/s0007_reverse_integer/readme.md

@@ -40,11 +40,6 @@ Given a signed 32-bit integer `x`, return `x` _with its digits reversed_. If rev
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0007_reverse_integer;
-
-
 class Solution {
     /**
      * @param Integer $x

src/main/php/g0001_0100/s0008_string_to_integer_atoi/readme.md

@@ -118,11 +118,6 @@ Since -91283472332 is less than the lower bound of the range [-2<sup>31</sup>, 2
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0008_string_to_integer_atoi;
-
-
 class Solution {
     /**
      * @param String $s

src/main/php/g0001_0100/s0009_palindrome_number/readme.md

@@ -46,11 +46,6 @@ An integer is a **palindrome** when it reads the same backward as forward. For e
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0009_palindrome_number;
-
-
 class Solution {
     /**
      * @param Integer $x

src/main/php/g0001_0100/s0010_regular_expression_matching/readme.md

@@ -61,11 +61,6 @@ The matching should cover the **entire** input string (not partial).
 ## Solution
 
 ```php
-<?php
-
-namespace leetcode\g0001_0100\s0010_regular_expression_matching;
-
-
 class Solution {
     private $cache;