ฟังก์ชัน strtotime สามารถใช้แปลงสตริงที่ให้มาเป็นรูปแบบเวลาได้ มาดูตัวอย่าง −ตัวอย่าง<?php $time_arr = [ 00:12:56, 10:11:12, 24:12:44, 50:51:52, 10:10:10 ]; $time = strtotime(00:00:00); $total_time = 0; foreach( $time_arr as $ele ) { $sec_time = strtotime($ele) - $time; $

ตัวอย่างโค้ด<?php function to_time_ago($time) { $difference = time() - $time; if ($difference 1 ? s : ) . ago; } } } echo The timestamp to time ago conversion is . to_time_ago(time() - 600); ?> ผลลัพธ์The timestamp to time ago conversion is 10 minutes ago คำอธิบา

ตัวอย่างโค้ด<?php $start = microtime(true); $val = 1; for ($i = 1; $i <= 1500; $i++) { $val++; } $end = microtime(true); $exec_time = $end - $start; echo The execution time of the PHP script is: $exec_time sec; ?> ผลลัพธ์The execution time of the PHP script is: 0.000123 sec คำอธิบาย m

ตัวอย่างโค้ด<?php $my_str = Thisis!@sample*on&ly)#$; $my_str = preg_replace(/[^a-z0-9]/i, , $my_str); echo The non-alphanumeric characters removed gives the string as . $my_str; ?> ผลลัพธ์The non-alphanumeric characters removed gives the string as Thisissampleonly คำอธิบาย Regex /[^a-z

ตัวอย่างโค้ด<?php $my_string = 456,789,23, 4, 019; $my_str_arr = preg_split(/,/, $my_string); print_r($my_str_arr); $my_string = 00, 876, 5432, 1234, 0; $my_str_arr = explode(,, $my_string); print_r($my_str_arr); ?> ผลลัพธ์ 0 ) คำอธิบาย preg_split() - Regex Split (Pattern: /,/) explode()

ตัวอย่างโค้ด<?php function check_prime($num) { if ($num == 1) return 0; for ($i = 2; $i <= $num / 2; $i++) { if ($num % $i == 0) return 0; } return 1; } $num = 47; $flag_val = check_prime($num); if ($flag_val == 1) echo It is a prime number; else echo It is a non-prime nu

ตัวอย่างโค้ด<?php function year_check($my_year) { if ($my_year % 400 == 0) { echo It is a leap year; } elseif ($my_year % 100 == 0) { echo It is not a leap year; } elseif ($my_year % 4 == 0) { echo It is a leap year; } else { echo It is not a leap y

ตัวอย่างโค้ด<?php function divisor_count($my_val) { $my_count = 0; for ($i = 1; $i <= sqrt($my_val) + 1; $i++) { if ($my_val % $i == 0) { $my_count += ($my_val / $i == $i) ? 1 : 2; } } if ($my_count % 2 == 0) { echo It is an even number\n; }

ตัวอย่างโค้ด 0) { $my_digit = $temp % 10; // Fixed: $my_val → $temp if (!divisibility_check($n, $my_digit)) { // Fixed: $my_val → $n return false; } $temp = (int)($temp / 10); // Fixed: /= 10 → int division } return true; } $val = 255; if (divi

ตัวอย่างโค้ด<?php function sum_of_cubes_even($val) { $init_sum = 0; for ($i = 0; $i < $val; $i++) { if ($i % 2 != 0) { $init_sum += (2 * $i) * (2 * $i) * (2 * $i); } } return $init_sum; } echo The sum of cubes of first 8 natural numbers that are even i

ตัวอย่างโค้ด<?php function even_nums_avg($val) { return $val + 1; } $val = 11; echo The average of the first n natural numbers that are even is . even_nums_avg($val); ?> ผลลัพธ์The average of the first n natural numbers that are even is 12 คำอธิบายและแก้ไข ปัญหา: ฟังก์ชัน even_nums_avg

ตัวอย่างโค้ด<?php function sum_of_fifth_pow($val) { $init_sum = 0; for ($i = 1; $i <= $val; $i++) { $init_sum += $i * $i * $i * $i * $i; } return $init_sum; } $val = 89; echo The sum of fifth powers of the first n natural numbers is . sum_of_fifth_pow($val); ?> ผลลัพ

ตัวอย่างโค้ด<?php function sum_of_nums($n_val, $k_val) { $tot_sum = ($n_val * ($n_val + 1)) / 2; $pow_val = $k_val; while ($pow_val <= $n_val) { $tot_sum -= $pow_val; $pow_val *= $k_val; } return $tot_sum; } $n_val = 20; $k_val = 3; echo The sum of first 20 na

ตัวอย่างโค้ด<?php function sum_of_cubes($val) { $init_sum = 0; for ($x = 1; $x <= $val; $x++) { $init_sum += $x * $x * $x; } return $init_sum; } echo The sum of cubes of first 8 natural numbers is . sum_of_cubes(8); ?> ผลลัพธ์The sum of cubes of first 8 natural numbe

ตัวอย่างโค้ด 0 && ($val_2 - $val_1) % $val_3 == 0) return true; return false; } $val_1 = 11; $val_2 = 99; $val_3 = 2; echo Is the number present in the sequence? ; if (contains_in_sequence($val_1, $val_2, $val_3)) { echo Yes, it is present in the sequence; } else { echo No, it is not p

ตัวอย่างโค้ด<?php function factorial_num($x_val) { $fact_num = 1; for ($i = 1; $i <= $x_val; $i++) { $fact_num *= $i; if ($fact_num % $x_val == 0) { return $i; } } return $x_val; // Fallback } $x_val = 16; echo The first natural number whose f

ตัวอย่างโค้ด<?php function missing_nums($my_arr, $arr_len, $val) { sort($my_arr); $i = 0; while ($i < $val && $my_arr[$i] <= 0) $i++; $count = 0; $current_num = 1; while ($count < $val && $i < $arr_len) { if ($my_arr[$i] != $current_num) { echo $current

ตัวอย่างโค้ด<?php function sum_of_nums($n_val, $x_val, $y_val) { $val_1 = floor((int)$n_val / $x_val) * (2 * $x_val + (int)((int)$n_val / $x_val - 1) * $x_val) / 2; $val_2 = floor((int)$n_val / $y_val) * (2 * $y_val + (int)((int)$n_val / $y_val - 1) * $y_val) / 2; $val_3 = floor((int)

ตัวอย่างโค้ด<?php function odd_num_sum($val) { $entries = (int)(($val + 1) / 2); $sum = $entries * $entries; return $sum; } function num_in_range($low, $high) { return odd_num_sum($high) - odd_num_sum($low - 1); } $low = 3; $high = 23; echo The sum of odd natural numbers between

ตัวอย่างโค้ด<?php function repeated_sub($val_1, $val_2) { if ($val_1 % $val_2 == 0) { return floor((int)$val_1 / $val_2); } return floor(((int)$val_1 / $val_2) + repeated_sub($val_2, $val_1 % $val_2)); } $val_1 = 1000; $val_2 = 189; echo The repeated subtraction results in .