![\"\ud83d\ude00\"](\"https:\/\/s.w.org\/images\/core\/emoji\/2.2.1\/svg\/1f600.svg\")
<\/p>\nOk, ch\u00e0o t\u1ea5t c\u1ea3 anh em <\/p>\n
Ch\u1ea3 l\u00e0 cu\u1ed1i tu\u1ea7n, \u1edf nh\u00e0 r\u1ea3nh rang, tr\u1eddi th\u00ec se se l\u1ea1nh, m\u0169i h\u01a1i t\u1eafc, ch\u1ec9 mu\u1ed1n co ro qu\u1ea5n ch\u0103n \u00f4m laptop cho \u1ea5m. Lang thang thi c\u00e1i cu\u1ed9c thi l\u1eadp tr\u00ecnh c\u1ee7a b\u1ecdn Top Career g\u00ec \u0111\u00f3 :v v\u00f4 t\u00ecnh v\u1ea5p ph\u1ea3i 1 b\u00e0i test demo, m\u00e0 m\u00ecnh th\u1ea5y kh\u00e1 hay, n\u00ean mu\u1ed1n chia s\u1ebb l\u00ean \u0111\u00e2y cho c\u1ea3 nh\u00e0 ![\"\ud83d\ude09\"](\"https:\/\/s.w.org\/images\/core\/emoji\/2.2.1\/svg\/1f609.svg\")
<\/p>\n
<\/span> D\u1ecbch \u0111\u1ea1i kh\u00e1i l\u00e0:<\/p>\n R\u1ed3i, \u0111\u1ec1 b\u00e0i l\u00e0 nh\u01b0 v\u1eady, y\u00eau c\u1ea7u vi\u1ebft 1 function d\u01b0\u1edbi ng\u00f4n ng\u1eef n\u00e0o c\u0169ng \u0111\u01b0\u1ee3c, th\u1eddi gian l\u00e0m b\u00e0i l\u00e0\u00a030 ph\u00fat<\/strong>.<\/p>\n GI\u1ea2I<\/strong><\/p>\n (\u0110\u00e2y l\u00e0 c\u00e1ch gi\u1ea3i c\u1ee7a m\u00ecnh, ai c\u00f3 c\u00e1ch n\u00e0o hay h\u01a1n th\u00ec comment nh\u00e9 H\u01b0\u1edbng gi\u1ea3i c\u1ee7a m\u00ecnh l\u00e0 s\u1ebd chia m\u1ea3ng 1 chi\u1ec1u n\u00e0y th\u00e0nh 2 ph\u1ea7n, T\u1ed5ng\u00a0<\/strong>Tr\u00e1i\u00a0<\/strong>v\u00e0 T\u1ed5ng\u00a0<\/strong>Ph\u1ea3i<\/strong>. Sau \u0111\u00f3 ch\u1ea1y d\u1ea7n t\u1eeb tr\u00e1i qua ph\u1ea3i c\u1ee7a m\u1ea3ng v\u00e0 so s\u00e1nh 2 t\u1ed5ng n\u00e0y v\u1edbi nhau. EZPZ ph\u1ea3i kh\u00f4ng? :))<\/em><\/p>\n M\u00ecnh code PHP nh\u00e9, \u0111\u1ea7u ti\u00ean g\u00e1n gi\u00e1 tr\u1ecb default ph\u00e1t\u00a0(th\u00f3i quen th\u00f4i, PHP kh\u00f4ng c\u1ea7n initialize bi\u1ebfn)<\/em><\/p>\n R\u1ed3i, b\u00e2y gi\u1edd l\u1eb7p qua c\u00e1i array A xem sao nh\u1ec9?<\/p>\n B\u1eaft \u0111\u1ea7u so s\u00e1nh, v\u00e0 ph\u1ea3i tr\u1eeb d\u1ea7n\u00a0$sumRight\u00a0<\/strong> t\u0103ng d\u1ea7n\u00a0$sumLeft\u00a0<\/strong>v\u1edbi gi\u00e1 tr\u1ecb c\u1ee7a m\u1ed7i element<\/p>\n Tr\u00f4ng c\u00f3 v\u1ebb \u1ed5n \u1ed5n r\u1ed3i \u0111\u1ea5y nh\u1ec9 :))<\/p>\n Nh\u01b0ng th\u1ef1c ra l\u00e0 \u0111\u1ebfch \u1ed5n, m\u00ecnh c\u00f2n ch\u01b0a check null c\u01a1 m\u00e0 =)) c\u00e1i c\u01a1 b\u1ea3n nh\u1ea5t c\u00f2n su\u1ed1t ng\u00e0y qu\u00ean \u0111\u00e2y<\/p>\n Ok done! N\u00e0o, b\u00e2y gi\u1edd test th\u00f4i!<\/p>\n Chu\u1ea9n \u0111\u00e9t :)) Test th\u1eed v\u1edbi d\u1eef li\u1ec7u\u00a0kh\u00e1c xem sao<\/p>\n Done! Hy v\u1ecdng anh em gi\u1ea3i to\u00e1n vui v\u1ebb :)) c\u00f3 solution n\u00e0o ngon h\u01a1n nh\u1edb comment -_- \u0111\u1eebng c\u00f3 \u00e9m h\u00e0ng<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":" M\u1ed9t b\u00e0i test l\u1eadp tr\u00ecnh 30 ph\u00fat: t\u00ecm ch\u1ec9 s\u1ed1 c\u00e2n b\u1eb1ng c\u1ee7a m\u1ea3ng v\u1edbi \u0111\u1ed9 ph\u1ee9c t\u1ea1p O(N). \u0110\u1ec1 b\u00e0i, h\u01b0\u1edbng gi\u1ea3i v\u00e0 code PHP ho\u00e0n ch\u1ec9nh.<\/p>","protected":false},"author":1,"featured_media":110,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[5],"tags":[],"class_list":["post-66","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-php"],"yoast_head":"\n
\n\u0110\u1ec1 b\u00e0i:<\/p>\nA zero-indexed array A consisting of N integers is given. An equilibrium index of this array is any integer P such that 0 \u2264 P < N and the sum of elements of lower indices is equal to the sum of elements of higher indices, i.e.\nA[0] + A[1] + ... + A[P\u22121] = A[P+1] + ... + A[N\u22122] + A[N\u22121].\nSum of zero elements is assumed to be equal to 0. This can happen if P = 0 or if P = N\u22121.\nFor example, consider the following array A consisting of N = 8 elements:\nA[0] = -1 A[1] = 3 A[2] = -4 A[3] = 5 A[4] = 1 A[5] = -6 A[6] = 2 A[7] = 1\nP = 1 is an equilibrium index of this array, because:\nA[0] = \u22121 = A[2] + A[3] + A[4] + A[5] + A[6] + A[7]\nP = 3 is an equilibrium index of this array, because:\nA[0] + A[1] + A[2] = \u22122 = A[4] + A[5] + A[6] + A[7]\nP = 7 is also an equilibrium index, because:\nA[0] + A[1] + A[2] + A[3] + A[4] + A[5] + A[6] = 0\nand there are no elements with indices greater than 7.\nP = 8 is not an equilibrium index, because it does not fulfill the condition 0 \u2264 P < N.\nWrite a function:\nfunction solution($A);\nthat, given a zero-indexed array A consisting of N integers, returns any of its equilibrium indices. The function should return \u22121 if no equilibrium index exists.\nFor example, given array A shown above, the function may return 1, 3 or 7, as explained above.\nAssume that:\nN is an integer within the range [0..100,000];\neach element of array A is an integer within the range [\u22122,147,483,648..2,147,483,647].\nComplexity:\nexpected worst-case time complexity is O(N);\nexpected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).\nElements of input arrays can be modified.\n<\/pre>\n
\nTa c\u00f3 1 indexed array A g\u1ed3m N ph\u1ea7n t\u1eed l\u00e0 c\u00e1c s\u1ed1 t\u1ef1 nhi\u00ean b\u1ea5t k\u1ef3. T\u00ecm ch\u1ec9 s\u1ed1 c\u00e2n b\u1eb1ng P sao cho P l\u00e0\n\n- Key c\u1ee7a array A\n- Th\u1ecfa m\u00e3n \u0111i\u1ec1u ki\u1ec7n: A[0] + A[1] + ... + A[P\u22121] = A[P+1] + ... + A[N\u22122] + A[N\u22121].\n- P = 0 ho\u1eb7c P= N-1 \u0111\u1ec1u c\u00f3 th\u1ec3 l\u00e0 gi\u00e1 tr\u1ecb \u0111\u00fang\n- C\u00f3 th\u1ec3 c\u00f3 nhi\u1ec1u ho\u1eb7c 1 gi\u00e1 tr\u1ecb P\n- N\u1ebfu kh\u00f4ng c\u00f3 gi\u00e1 tr\u1ecb n\u00e0o, function c\u1ea7n return -1\nC\u00e1c \u0111i\u1ec1u ki\u1ec7n v\u1ec1 complexity, assumption m\u1eddi xem ph\u1ea7n ti\u1ebfng Anh nh\u00e9, l\u01b0\u1eddi d\u1ecbch :D\n<\/pre>\n
\n\n
\n )<\/em><\/p>\n\r\nfunction ($A)\r\n{\r\n $sumLeft = 0;\r\n $sumRight = array_sum($A);\r\n $equi = -1;\r\n}\r\n \r\n\/\/$A l\u00e0 arrray nh\u1eadp v\u00e0o\r\n\/\/$equi l\u00e0 s\u1ed1 P c\u1ea7n t\u00ecm\r\n<\/pre>\n\n\r\nfunction ($A)\r\n{\r\n $sumLeft = 0;\r\n $sumRight = array_sum($A);\r\n $equi = \u20131;\r\n for ($index = 0; $index < count($A); $index++) {\r\n \/\/So s\u00e1nh $sumLeft v\u1edbi $sumRight trong n\u00e0y\r\n \/\/M\u00ecnh d\u00f9ng for thay v\u00ec foreach do l\u00fd do performance\r\n }\r\n return $equi;\r\n}\r\n<\/pre>\n\n\r\nfunction ($A)\r\n{\r\n $sumLeft = 0;\r\n $sumRight = array_sum($A);\r\n $equi = \u20131;\r\n for ($index = 0; $index < count($A); $index++) {\r\n $tempRight = $sumRight \u2013 $A[$index];\r\n if ($sumLeft === $tempRight) {\r\n $equi = $index;\r\n return $equi;\r\n } else {\r\n $sumLeft += $A[$index];\r\n $sumRight = $tempRight;\r\n }\r\n }\r\n return $equi;\r\n}\r\n<\/pre>\n\n\r\nfunction ($A)\r\n{\r\n $sumLeft = 0;\r\n $sumRight = array_sum($A);\r\n $equi = \u20131;\r\n if (count($A)) {\r\n for ($index = 0; $index < count($A); $index++) {\r\n $tempRight = $sumRight \u2013 $A[$index];\r\n if ($sumLeft === $tempRight) {\r\n $equi = $index;\r\n return $equi;\r\n }\r\n $sumLeft += $A[$index];\r\n $sumRight = $tempRight;\r\n }\r\n return $equi;\r\n }\r\n return \u20131;\r\n}\r\n<\/pre>\n\n\r\necho demo([4, 35, 80, 123, 12345, 44, 8, 5, 24, 3]);\r\n<\/pre>\n
![\"result-1\"](\"https:\/\/i0.wp.com\/dangnh.cf\/wp-content\/uploads\/2017\/05\/result-1.png?resize=509%2C167&ssl=1\")
\r\necho demo([-1, 3, -4, 5, 1, -6, 2, 1]);\r\n<\/pre>\n
![\"result-2\"](\"https:\/\/i0.wp.com\/dangnh.cf\/wp-content\/uploads\/2017\/05\/result-2.png?resize=404%2C127&ssl=1\")
![\"\ud83d\ude42\"](\"https:\/\/s.w.org\/images\/core\/emoji\/2.2.1\/svg\/1f642.svg\")
<\/strong><\/p>\n