The following code is better than most of the results returned by baidu or google. Time complexity is O((m+n)/2), Space complexity is O(1).
1 double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2)
2 {
3 int nums1_i = 0, nums2_i = 0;
4 int mid1 = 0, mid2 = 0, count = 0;
5 while (nums1_i < nums1.size() && nums2_i < nums2.size())
6 {
7 if (count++ > ((nums1.size() + nums2.size()) / 2)) break;
8 mid1 = mid2;
9 mid2 = (nums1[nums1_i] < nums2[nums2_i] ? nums1[nums1_i++] : nums2[nums2_i++]);
10 }
11
12 while (nums1_i < nums1.size())
13 {
14 if (count++ > ((nums1.size() + nums2.size()) / 2)) break;
15 mid1 = mid2;
16 mid2 = nums1[nums1_i++];
17 }
18
19 while (nums2_i < nums2.size())
20 {
21 if (count++ > ((nums1.size() + nums2.size()) / 2)) break;
22 mid1 = mid2;
23 mid2 = nums2[nums2_i++];
24 }
25
26 return (nums1.size() + nums2.size()) % 2 == 0
27 ? (mid1 + mid2) / 2.0
28 : mid2;
29 }
2 {
3 int nums1_i = 0, nums2_i = 0;
4 int mid1 = 0, mid2 = 0, count = 0;
5 while (nums1_i < nums1.size() && nums2_i < nums2.size())
6 {
7 if (count++ > ((nums1.size() + nums2.size()) / 2)) break;
8 mid1 = mid2;
9 mid2 = (nums1[nums1_i] < nums2[nums2_i] ? nums1[nums1_i++] : nums2[nums2_i++]);
10 }
11
12 while (nums1_i < nums1.size())
13 {
14 if (count++ > ((nums1.size() + nums2.size()) / 2)) break;
15 mid1 = mid2;
16 mid2 = nums1[nums1_i++];
17 }
18
19 while (nums2_i < nums2.size())
20 {
21 if (count++ > ((nums1.size() + nums2.size()) / 2)) break;
22 mid1 = mid2;
23 mid2 = nums2[nums2_i++];
24 }
25
26 return (nums1.size() + nums2.size()) % 2 == 0
27 ? (mid1 + mid2) / 2.0
28 : mid2;
29 }
]]>
Compile boost run:
bjam stage --toolset=msvc-10.0 link=static runtime-link=static threading=multi debug release
]]>
姝婚攣錛氫竴縐嶆儏褰紝姝ゆ椂鎵ц紼嬪簭涓袱涓垨澶氫釜綰跨▼鍙戠敓姘鎬箙鍫靛錛堢瓑寰咃級錛屾瘡涓嚎紼嬮兘鍦ㄧ瓑寰呰
鍏朵粬綰跨▼鍗犵敤騫跺牭濉炰簡鐨勮祫婧愩備緥濡傦紝濡傛灉綰跨▼A閿佷綇浜嗚褰?騫剁瓑寰呰褰?錛岃岀嚎紼婤閿佷綇浜嗚褰?騫剁瓑寰呰褰?錛岃繖鏍蜂袱涓嚎紼嬪氨鍙戠敓浜嗘閿佺幇璞°?/span>
gdb璋冭瘯姝婚攣鐨勬柟娉曪細
gdb
attach pid
thread apply all bt
鎵懼埌_lll_lock_wait 閿佺瓑寰呯殑鍦版柟銆?/span>
鐒跺悗鏌ユ壘璇ラ攣琚摢涓嚎紼嬮攣浣忎簡銆?/span>
渚嬪錛?/span>
鏌ョ湅鍝釜綰跨▼鎷ユ湁浜掓枼浣擄紙鐒跺悗list浠ｇ爜錛屾煡鐪嬩嬌鐢ㄤ簰鏂ュ彉閲忕殑鍚嶇О錛?br />
(gdb) print AccountA_mutex
$1 = {__m_reserved = 2, __m_count = 0, __m_owner = 0x2527,
__m_kind = 0, __m_lock
= {__status = 1, __spinlock = 0}}
(gdb) print 0x2527
$2 = 9511
(gdb) print AccountB_mutex
$3 = {__m_reserved = 2, __m_count = 0, __m_owner = 0x2529,
__m_kind = 0, __m_lock = {__status = 1, __spinlock = 0}}
(gdb) print 0x2529
$4 = 9513
(gdb)
浠庝笂闈㈢殑鍛戒護涓紝鎴戜滑鍙互鐪嬪嚭AccontA_mutex鏄綰跨▼ 5錛圠WP 9511錛夊姞閿侊紙鎷ユ湁錛夌殑錛岃孉ccontB_mutex鏄綰跨▼ 3錛圠WP 9513錛夊姞閿侊紙鎷ユ湁錛夌殑銆?/span>
]]>